Sciweavers

1157 search results - page 12 / 232
» Descriptive Complexity and Model Checking
Sort
View
CADE
2007
Springer
14 years 7 months ago
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
Andrei Voronkov, Juan Antonio Navarro Pérez
SDL
2003
158views Hardware» more  SDL 2003»
13 years 8 months ago
Automatic Formal Model Generation and Analysis of SDL
A tool for verification of distributed systems defined using standard SDL-96 is described. The SDL description is automatically translated into a high-level Petri net model which...
Annikka Aalto, Nisse Husberg, Kimmo Varpaaniemi
ASPDAC
2007
ACM
158views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Symbolic Model Checking of Analog/Mixed-Signal Circuits
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
David Walter, Scott Little, Nicholas Seegmiller, C...
IJAC
2010
231views more  IJAC 2010»
13 years 4 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa
DAGSTUHL
2004
13 years 9 months ago
Refinement and Consistency in Multiview Models
Abstract. Model transformations are an integral part of OMG's standard for Model Driven Architecture (MDA). Model transformations should at the best allow for a seamless trans...
Heike Wehrheim