2291 search results - page 107 / 459 » Logic Programming and Model Checking |
127
click to vote
CONCUR
2000
Springer
15 years 6 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
93
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...
130
click to vote
CNL
2009
15 years 3 months ago
2009
Abstract. This paper discusses the semi-formal language of mathematics and presents the Naproche CNL, a controlled natural language for mathematical authoring. Proof Representation...
LPNMR
2009
Springer
15 years 9 months ago
2009
Springer
Building upon the 2-valued Layered Models semantics for normal programs, we introduce a refinement — the Layer Supported Models semantics — which, besides keeping all of LMs...
110
click to vote
EMSOFT
2006
Springer
15 years 6 months ago
2006
Springer
A key problem for effective unit testing is the difficulty of partitioning large software systems into appropriate units that can be tested in isolation. We present an approach th...