Sciweavers

2911 search results - page 371 / 583
» A Logic of Graph Constraints
Sort
View
CADE
2011
Springer
14 years 6 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
VMCAI
2009
Springer
16 years 1 months ago
Reducing Behavioural to Structural Properties of Programs with Procedures
Abstract There is an intimate link between program structure and behaviour. Exploiting this link to phrase program correctness problems in terms of the structural properties of a p...
Dilian Gurov, Marieke Huisman
SEMCO
2009
IEEE
16 years 1 months ago
Using a Formal Language Constructs for Software Model Evolution
— In this paper we present an automated support for software model evolution using a formal language constructs. For this, we extended Object Constraint Language (OCL) with actio...
Samuel A. Ajila, Shahid Alam
SOFSEM
2007
Springer
16 years 20 days ago
Exact Max 2-Sat: Easier and Faster
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
Martin Fürer, Shiva Prasad Kasiviswanathan
WABI
2007
Springer
122views Bioinformatics» more  WABI 2007»
16 years 20 days ago
Algorithms for the Extraction of Synteny Blocks from Comparative Maps
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
Vicky Choi, Chunfang Zheng, Qian Zhu, David Sankof...