Sciweavers

955 search results - page 44 / 191
» Model Checking Operator Procedures
Sort
View
117
Voted
ICLP
1997
Springer
15 years 6 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
ATVA
2008
Springer
99views Hardware» more  ATVA 2008»
15 years 4 months ago
Model Checking Recursive Programs with Exact Predicate Abstraction
e Abstraction Arie Gurfinkel1 , Ou Wei2 , and Marsha Chechik2 1 Software Engineering Institute, Carnegie Mellon University 2 Department of Computer Science, University of Toronto A...
Arie Gurfinkel, Ou Wei, Marsha Chechik
CPAIOR
2007
Springer
15 years 8 months ago
Eliminating Redundant Clauses in SAT Instances
In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...
Olivier Fourdrinoy, Éric Grégoire, B...
SIGSOFT
2009
ACM
16 years 3 months ago
Probabilistic environments in the quantitative analysis of (non-probabilistic) behaviour models
System specifications have long been expressed through automata-based languages, enabling verification techniques such as model checking. These verification techniques can assess ...
Esteban Pavese, Sebastián Uchitel, Ví...
ICSE
2008
IEEE-ACM
16 years 3 months ago
Sufficient mutation operators for measuring test effectiveness
Mutants are automatically-generated, possibly faulty variants of programs. The mutation adequacy ratio of a test suite is the ratio of non-equivalent mutants it is able to identif...
Akbar Siami Namin, James H. Andrews, Duncan J. Mur...