3693 search results - page 342 / 739 » Splitting a Logic Program |
145
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
153
click to vote
VSTTE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The Verifying Compiler checks the correctness of the program it compiles. The workhorse of such a tool is the reasoning engine, which decides validity of formulae in a su...
113
click to vote
APN
2003
Springer
15 years 9 months ago
2003
Springer
The Model-Checking Kit [8] is a collection of programs which allow to model finite state systems using a variety of modelling languages, and verify them using a variety of checker...
141
Voted
WOLLIC
2010
Springer
15 years 9 months ago
2010
Springer
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents ...
129
click to vote
ENTCS
2008
15 years 4 months ago
2008
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...