Sciweavers

209 search results - page 11 / 42
» An executable formal semantics of C with applications
Sort
View
EMSOFT
2007
Springer
13 years 11 months ago
Necessary and sufficient conditions for deterministic desynchronization
Synchronous reactive formalisms associate concurrent behaviors to precise schedules on global clock(s). This allows a non-ambiguous notion of "absent" signal, which can ...
Dumitru Potop-Butucaru, Robert de Simone, Yves Sor...
ICCS
1999
Springer
13 years 11 months ago
Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis
Conceptual Graphs and Formal Concept Analysis have in common basic concerns: the focus on conceptual structures, the use of diagrams for supporting communication, the orientation b...
Guy W. Mineau, Gerd Stumme, Rudolf Wille
GPCE
2007
Springer
14 years 1 months ago
Simple and safe SQL queries with c++ templates
Most software applications use a relational database for data management and storage. Interaction with such a database is often done by letting the program construct strings with ...
Joseph Gil, Keren Lenz
CCS
2008
ACM
13 years 9 months ago
Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for google apps
Single-Sign-On (SSO) protocols enable companies to establish a federated environment in which clients sign in the system once and yet are able to access to services offered by dif...
Alessandro Armando, Roberto Carbone, Luca Compagna...
CAV
2009
Springer
134views Hardware» more  CAV 2009»
14 years 8 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...