Sciweavers

3481 search results - page 627 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
CADE
2007
Springer
15 years 10 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
OOPSLA
2007
Springer
15 years 3 months ago
A rewriting approach to the design and evolution of object-oriented languages
Abstract. Object-oriented language concepts have been highly successful, resulting in a large number of object-oriented languages and language extensions. Unfortunately, formal met...
Mark Hills, Grigore Rosu
FCCM
2006
IEEE
133views VLSI» more  FCCM 2006»
15 years 3 months ago
A Field Programmable RFID Tag and Associated Design Flow
Current Radio Frequency Identification (RFID) systems generally have long design times and low tolerance to changes in specification. This paper describes a field programmable,...
Alex K. Jones, Raymond R. Hoare, Swapna R. Donthar...
KBSE
2005
IEEE
15 years 3 months ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander
ECML
2005
Springer
15 years 3 months ago
Mode Directed Path Finding
Abstract. Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbi...
Irene M. Ong, Inês de Castro Dutra, David Pa...