1226 search results - page 133 / 246 » Proofs, Programs and Abstract Complexity |
111
click to vote
BIRTHDAY
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...
130
Voted
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambie...
133
click to vote
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
155
click to vote
INFORMS
1998
15 years 3 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
155
Voted
LOPSTR
2005
Springer
15 years 9 months ago
2005
Springer
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...