116 search results - page 6 / 24 » Automatic Abstraction for Intervals Using Boolean Formulae |
JSAT
2006
14 years 9 months ago
2006
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...
84
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
AI
2008
Springer
14 years 9 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
DATE
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Nowadays, modeling languages like UML are essential in the design of complex software systems and also start to enter the domain of hardware and hardware/software codesig...