Sciweavers

62 search results - page 5 / 13
» Formal Verification of a Combination Decision Procedure
Sort
View
TOCL
2008
128views more  TOCL 2008»
13 years 9 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
ECSA
2008
Springer
13 years 11 months ago
Automating Architecture Trade-Off Decision Making through a Complex Multi-attribute Decision Process
A typical software architecture design process requires the architects to make various trade-off architecture decisions. The architects need to consider different possibilities and...
Majid Makki, Ebrahim Bagheri, Ali A. Ghorbani
CADE
2006
Springer
14 years 10 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
ICCAD
1996
IEEE
93views Hardware» more  ICCAD 1996»
14 years 2 months ago
VERILAT: verification using logic augmentation and transformations
This paper presents a new framework for formal logic verification. What is depicted here is fundamentally different from previous approaches. In earlier approaches, the circuit is ...
Dhiraj K. Pradhan, Debjyoti Paul, Mitrajit Chatter...
ENTCS
2008
89views more  ENTCS 2008»
13 years 10 months ago
CC(X): Semantic Combination of Congruence Closure with Solvable Theories
We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in so...
Sylvain Conchon, Evelyne Contejean, Johannes Kanig...