Sciweavers

1613 search results - page 262 / 323
» Functional and Constraint Logic Programming
Sort
View
ICFP
2005
ACM
14 years 8 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
POPL
2012
ACM
12 years 4 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
CGO
2009
IEEE
14 years 3 months ago
Stream Compilation for Real-Time Embedded Multicore Systems
Abstract—Multicore systems have not only become ubiquitous in the desktop and server worlds, but are also becoming the standard in the embedded space. Multicore offers programabi...
Yoonseo Choi, Yuan Lin, Nathan Chong, Scott A. Mah...
DSN
2002
IEEE
14 years 1 months ago
Model Checking Performability Properties
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
Boudewijn R. Haverkort, Lucia Cloth, Holger Herman...
AISC
2004
Springer
14 years 2 months ago
Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...
Bruno Buchberger