Sciweavers

1144 search results - page 115 / 229
» Logic programming for combinatorial problems
Sort
View
153
Voted
POPL
1992
ACM
15 years 6 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
112
Voted
CORR
2004
Springer
151views Education» more  CORR 2004»
15 years 2 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
134
Voted
ICTAC
2010
Springer
15 years 17 days ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
234
Voted
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 7 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
112
Voted
CADE
2009
Springer
15 years 9 months ago
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
Shuvendu K. Lahiri, Shaz Qadeer