Sciweavers

87 search results - page 12 / 18
» On Reachability of Minimal Models of Multilattice-Based Logi...
Sort
View
142
Voted
IOR
2006
177views more  IOR 2006»
15 years 4 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
172
Voted
CCS
2005
ACM
15 years 10 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
15 years 11 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
CONCUR
2007
Springer
15 years 11 months ago
Coalgebraic Models for Reactive Systems
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
Filippo Bonchi, Ugo Montanari
CN
2006
70views more  CN 2006»
15 years 5 months ago
Preventing persistent oscillations and loops in IBGP configuration with route reflection
Abstract-- Internal Border Gateway Protocol (IBGP) is responsible for distributing external reachability information, obtained via External-BGP (EBGP) sessions, within an autonomou...
Anuj Rawat, Mark A. Shayman