310 search results - page 35 / 62 » Sound and complete models of contracts |
POPL
2000
ACM
14 years 1 months ago
2000
ACM
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...
AAAI
2008
13 years 11 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
CAV
2000
Springer
14 years 18 days ago
2000
Springer
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
CASCON
2010
13 years 4 months ago
2010
ion and giving them a medium to express and implement change. One of the keys to achieve agility for creating business processes depends on close interaction between IT department ...
IJCAI
2007
13 years 10 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...