Sciweavers

3713 search results - page 152 / 743
» Constructing a Calculus of Programs
Sort
View
235
Voted
POPL
2007
ACM
16 years 3 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
132
Voted
PLILP
1993
Springer
15 years 7 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
143
Voted
POPL
1990
ACM
15 years 6 months ago
Concurrent Constraint Programming
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
Vijay A. Saraswat, Martin C. Rinard
138
Voted
JFP
2008
125views more  JFP 2008»
15 years 3 months ago
Types and trace effects of higher order programs
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...
Christian Skalka, Scott F. Smith, David Van Horn
142
Voted
JAR
2002
83views more  JAR 2002»
15 years 3 months ago
Mathematical Programming Embeddings of Logic
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
Vivek S. Borkar, Vijay Chandru, Sanjoy K. Mitter