Sciweavers

16 search results - page 2 / 4
» Canonization for Disjoint Unions of Theories
Sort
View
FROCOS
2007
Springer
13 years 10 months ago
Combining Proof-Producing Decision Procedures
Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...
Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tr...
AGP
1999
IEEE
13 years 9 months ago
Comparing expressiveness of set constructor symbols
In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove...
Agostino Dovier, Carla Piazza, Alberto Policriti
CASES
2006
ACM
13 years 8 months ago
State space reconfigurability: an implementation architecture for self modifying finite automata
Many embedded systems exhibit temporally and behaviorally disjoint behavior slices. When such behaviors are captured by state machines, the current design flow will capture it as ...
Ka-Ming Keung, Akhilesh Tyagi
ADC
2005
Springer
111views Database» more  ADC 2005»
13 years 10 months ago
Redundancy, Dependencies and Normal Forms for XML Databases
With the advent of XML and its use as a database language, dependency and normal form theory has attracted novel research interest. Several approaches to build up a dependency and...
Klaus-Dieter Schewe
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 2 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...