Sciweavers

632 search results - page 54 / 127
» Combining programming with theorem proving
Sort
View
POPL
1992
ACM
13 years 12 months ago
Abstract Semantics for a Higher-Order Functional Language with Logic Variables
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
Radha Jagadeesan, Keshav Pingali
ENTCS
2007
96views more  ENTCS 2007»
13 years 7 months ago
Synchrony vs Asynchrony in Communication Primitives
We study, from the expressiveness point of view, the impact of synchrony in the communication primitives that arise when combining together some common and useful programming feat...
Daniele Gorla
ICFP
2003
ACM
14 years 7 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano
SIGCSE
2002
ACM
202views Education» more  SIGCSE 2002»
13 years 7 months ago
A tutorial program for propositional logic with human/computer interactive learning
This paper describes a tutorial program that serves a double role as an educational tool and a research environment. First, it introduces students to fundamental concepts of propo...
Stacy Lukins, Alan Levicki, Jennifer Burg
MICAI
2000
Springer
13 years 11 months ago
Searching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
Raul Monroy, Alan Bundy, Ian Green