509 search results - page 63 / 102 » On the completeness of compositional reasoning methods |
TOOLS
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract. A popular approach to compositional verification of component-based applications is based on the assume-guarantee paradigm, where an assumption models behavior of an env...
FMCO
2007
Springer
14 years 3 months ago
2007
Springer
This article considers the coordination language Reo, a Petri net variant called zero-safe nets, and intuitionistic temporal linear logic (ITLL). The first part examines the seman...
LREC
2008
13 years 10 months ago
2008
Dating of contents is relevant to multiple advanced Natural Language Processing (NLP) applications, such as Information Retrieval or Question Answering. These could be improved by...
C3S2E
2010
ACM
13 years 10 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
LPAR
2012
Springer
12 years 4 months ago
2012
Springer
traction with Interpolants for Arrays Francesco Alberti1 , Roberto Bruttomesso2 , Silvio Ghilardi2 , Silvio Ranise3 , Natasha Sharygina1 1 Universit`a della Svizzera Italiana, Luga...