Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Tearing based automatic abstraction for CTL model checking
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Model checking
Introduction to Process Algebra
Introduction to Process Algebra
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Research paradigms in computer science
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Abstraction Refinement for Large Scale Model Checking (Series on Integrated Circuits and Systems)
Abstraction Refinement for Large Scale Model Checking (Series on Integrated Circuits and Systems)
Three Paradigms of Computer Science
Minds and Machines
Introduction to Software Testing
Introduction to Software Testing
Temporal Logic and State Systems (Texts in Theoretical Computer Science. An EATCS Series)
Temporal Logic and State Systems (Texts in Theoretical Computer Science. An EATCS Series)
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Problems in the ontology of computer programs
Applied Ontology
Scientific Theories of Computational Systems in Model Checking
Minds and Machines
Computing as a Science: A Survey of Competing Viewpoints
Minds and Machines
Hi-index | 0.00 |
Questions concerning the epistemological status of computer science are, in this paper, answered from the point of view of the formal verification framework. State space reduction techniques adopted to simplify computational models in model checking are analysed in terms of Aristotelian abstractions and Galilean idealizations characterizing the inquiry of empirical systems. Methodological considerations drawn here are employed to argue in favour of the scientific understanding of computer science as a discipline. Specifically, reduced models gained by Data Abstraction are acknowledged as Aristotelian abstractions that include only data which are sufficient to examine the interested executions. The present study highlights how the need to maximize incompatible properties is at the basis of both Abstraction Refinement, the process of generating a cascade of computational models to achieve a balance between simplicity and informativeness, and the Multiple Model Idealization approach in biology. Finally, fairness constraints, imposed to computational models to allow fair behaviours only, are defined as ceteris paribus conditions under which temporal formulas, formalizing software requirements, acquire the status of law-like statements about the software systems executions.