Sciweavers

2291 search results - page 145 / 459
» Logic Programming and Model Checking
Sort
View
CHARME
2001
Springer
105views Hardware» more  CHARME 2001»
15 years 7 months ago
Net Reductions for LTL Model-Checking
We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wel...
Javier Esparza, Claus Schröter
105
Voted
SAC
2008
ACM
15 years 2 months ago
Using simplified event calculus in digital investigation
In a hypothesis-based approach to digital investigation, the investigator formulates his hypothesis about which events took place, and tests them using the evidence available. A f...
Svein Yngvar Willassen
126
Voted
FMSD
2010
118views more  FMSD 2010»
15 years 1 months ago
On simulation-based probabilistic model checking of mixed-analog circuits
In this paper, we consider verifying properties of mixed-signal circuits, i.e., circuits for which there is an interaction between analog (continuous) and digital (discrete) values...
Edmund M. Clarke, Alexandre Donzé, Axel Leg...
102
Voted
AGP
1993
IEEE
15 years 6 months ago
A Note on Logic Programming Fixed-Point Semantics
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...
Vladimiro Sassone
146
Voted
KBSE
2000
IEEE
15 years 6 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula