Sciweavers

1941 search results - page 118 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
CADE
2008
Springer
16 years 3 months ago
Proving Bounds on Real-Valued Functions with Computations
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Guillaume Melquiond
104
Voted
FOSSACS
2007
Springer
15 years 9 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
141
Voted
PASTE
2004
ACM
15 years 8 months ago
Validation of assembler programs for DSPs: a static analyzer
Digital Signal Processors are widely used in critical embedded systems to pilot low-level, often critical functionalities. We describe a static analyzer based on abstract interpre...
Matthieu Martel
BIRTHDAY
2008
Springer
15 years 5 months ago
A Category of Explicit Fusions
Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotati...
Filippo Bonchi, Maria Grazia Buscemi, Vincenzo Cia...
120
Voted
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
15 years 8 months ago
Analysing Randomized Distributed Algorithms
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
Gethin Norman