Sciweavers

1312 search results - page 1 / 263
» Formally Optimal Boxing
Sort
View
POPL
1994
ACM
13 years 9 months ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen
PDSE
1998
131views more  PDSE 1998»
13 years 6 months ago
A Formally Founded Description Technique for Business Processes
As a means of modeling typical system behavior, we present a description technique for business processes derived from data flow nets and provide it with a formal semantics based ...
Veronika Thurner
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
13 years 3 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki
ESSOS
2010
Springer
14 years 1 months ago
Formally-Based Black-Box Monitoring of Security Protocols
In the challenge of ensuring the correct behaviour of legacy implementations of security protocols, a formally-based approach is presented to design and implement monitors that sto...
Alfredo Pironti, Jan Jürjens
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
13 years 8 months ago
Structure and metaheuristics
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
Yossi Borenstein, Riccardo Poli