Sciweavers

233 search results - page 21 / 47
» Applications of Polytypism in Theorem Proving
Sort
View
CADE
1998
Springer
15 years 4 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary
FAC
2008
97views more  FAC 2008»
14 years 11 months ago
A functional formalization of on chip communications
This paper presents a formal model and a systematic approach to the validation of communication tures at a high level of abstraction. This model is described mathematically by a fu...
Julien Schmaltz, Dominique Borrione
78
Voted
SSS
2009
Springer
138views Control Systems» more  SSS 2009»
15 years 6 months ago
Analysis of Wireless Sensor Network Protocols in Dynamic Scenarios
We describe an approach to the analysis of protocols for wireless sensor networks in scenarios with mobile nodes and dynamic link quality. The approach is based on the theorem prov...
Cinzia Bernardeschi, Paolo Masci, Holger Pfeifer
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
15 years 5 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar
APLAS
2008
ACM
15 years 1 months ago
An Operational Semantics for JavaScript
We define a small-step operational semantics for the ECMAScript standard language corresponding to JavaScript, as a basis for analyzing security properties of web applications and ...
Sergio Maffeis, John C. Mitchell, Ankur Taly