Sciweavers

198 search results - page 31 / 40
» Time Equations for Lazy Functional (Logic) Languages
Sort
View
CGO
2008
IEEE
14 years 3 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
HASKELL
2006
ACM
14 years 3 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
CONCUR
1990
Springer
14 years 1 months ago
A Temporal Calculus of Communicating Systems
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...
Faron Moller, Chris M. N. Tofts
SAT
2009
Springer
126views Hardware» more  SAT 2009»
14 years 3 months ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia
TOOLS
2000
IEEE
14 years 1 months ago
Extending Business Objects with Business Rules
It is common to imbed business rules within the code of distributed object systems. When business practices and/or policies change, as they often do, it is difficult if not imposs...
Isabelle Rouvellou, Lou Degenaro, Kevin Rasmus, Da...