Sciweavers

93 search results - page 14 / 19
» Nonterminal Complexity of Some Operations on Context-Free La...
Sort
View
DAGSTUHL
2006
13 years 9 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga
AGS
2009
Springer
14 years 2 months ago
Intelligent Agent Modeling as Serious Game
We propose a novel approach to intelligent tutoring gaming simulations designed for both educational and inquiry purposes in complex multi-actor systems such as infrastructures or...
D. W. F. van Krevelen
ECOOP
1999
Springer
13 years 11 months ago
Foundations for Virtual Types
Virtual types have been proposed as a notation for generic programming in object-oriented languages—an alternative to the more familiar mechanism of parametric classes. The trade...
Atsushi Igarashi, Benjamin C. Pierce
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
CSL
2004
Springer
14 years 28 days ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...