4502 search results - page 806 / 901 » Regular Model Checking |
113
Voted
ISSTA
2010
ACM
15 years 3 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
94
Voted
DAC
2005
ACM
15 years 3 months ago
2005
ACM
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
112
click to vote
CP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...
103
click to vote
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
Abstract-- Autonomous robots are complex systems that require the interaction/cooperation of numerous heterogeneous software components. Nowadays, robots are critical systems and m...
102
Voted
ERLANG
2008
ACM
15 years 2 months ago
2008
ACM
When creating software, data types are the basic bricks. Most of the time a programmer will use data types defined in library modules, therefore being tested by many users over ma...