Sciweavers

934 search results - page 113 / 187
» Elementary Sets of Logic Programs
Sort
View
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
15 years 10 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
CORR
2008
Springer
158views Education» more  CORR 2008»
14 years 10 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau
FMOODS
2003
14 years 11 months ago
Inheritance of Temporal Logic Properties
Abstract. Inheritance is one of the key features for the success of objectoriented languages. Inheritance (or specialisation) supports incremental design and re-use of already writ...
Heike Wehrheim
TCAD
2008
101views more  TCAD 2008»
14 years 9 months ago
Using Field-Repairable Control Logic to Correct Design Errors in Microprocessors
Functional correctness is a vital attribute of any hardware design. Unfortunately, due to extremely complex architectures, widespread components, such as microprocessors, are often...
Ilya Wagner, Valeria Bertacco, Todd M. Austin
73
Voted
CTCS
1989
Springer
15 years 2 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002