3572 search results - page 337 / 715 » Nominal Logic Programming |
183
click to vote
ICALP
2009
Springer
16 years 7 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...
193
click to vote
VSTTE
2005
Springer
16 years 8 days 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...
146
click to vote
APN
2003
Springer
16 years 1 days 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...
179
click to vote
WOLLIC
2010
Springer
15 years 12 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 ...
186
click to vote
AMAST
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...