Sciweavers

499 search results - page 63 / 100
» LTL satisfiability checking
Sort
View
EUROCAST
2009
Springer
153views Hardware» more  EUROCAST 2009»
14 years 9 months ago
Algorithm for Testing the Leibniz Algebra Structure
Abstract. Given a basis of a vector space V over a field K and a multiplication table which defines a bilinear map on V , we develop a computer program on Mathematica which checks ...
José Manuel Casas, Manuel A. Insua, Manuel ...
AI
2000
Springer
14 years 11 months ago
EXPTIME tableaux for ALC
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
Francesco M. Donini, Fabio Massacci
ICSE
2004
IEEE-ACM
15 years 12 months ago
Assume-Guarantee Verification of Source Code with Design-Level Assumptions
Model checking is an automated technique that can be used to determine whether a system satisfies certain required properties. To address the "state explosion" problem a...
Dimitra Giannakopoulou, Corina S. Pasareanu, Jamie...
ICSE
2007
IEEE-ACM
15 years 12 months ago
Sequential Circuits for Relational Analysis
The Alloy tool-set has been gaining popularity as an alternative to traditional manual testing and checking for design correctness. Alloy uses a first-order relational logic for m...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
FM
2006
Springer
161views Formal Methods» more  FM 2006»
15 years 3 months ago
Changing Programs Correctly: Refactoring with Specifications
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
Fabian Bannwart, Peter Müller