713 search results - page 107 / 143 » Model Checking and Transitive-Closure Logic |
124
click to vote
SIGSOFT
2007
ACM
16 years 1 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
108
Voted
PLDI
2009
ACM
15 years 7 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
79
Voted
ICLP
1987
Springer
15 years 4 months ago
1987
Springer
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...
132
click to vote
CORR
2010
Springer
15 years 17 days ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
111
Voted
CADE
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...