444 search results - page 81 / 89 » Automated Logical Verification Based on Trace Abstractions |
106
click to vote
COMMA
2008
15 years 1 months ago
2008
Abstract. In previous work, we presented an RDFS ontology, based on the Argument Interchange Format (AIF), for describing arguments and argument schemes. We also implemented a pilo...
103
click to vote
ICLP
2005
Springer
15 years 5 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
116
click to vote
ICLP
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...
ASPDAC
2007
ACM
15 years 3 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
117
click to vote
FMCAD
2008
Springer
15 years 1 months ago
2008
Springer
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...