Sciweavers

13 search results - page 3 / 3
» Symbolic Abstraction and Deadlock-Freeness Verification of I...
Sort
View
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 12 days ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
POPL
2010
ACM
14 years 2 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
COMPUTER
2008
92views more  COMPUTER 2008»
13 years 5 months ago
Can Programming Be Liberated, Period?
higher, more appropriate, level of abstraction. It still entails writing programs, usually by using symbols, keywords, and operational instructions to tell the computer what we wan...
David Harel