Sciweavers

200 search results - page 40 / 40
» Symbolic Equivalences for Open Systems
Sort
View
EUROSYS
2007
ACM
14 years 2 months ago
Melange: creating a "functional" internet
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...
Anil Madhavapeddy, Alex Ho, Tim Deegan, David Scot...
SEMWEB
2009
Springer
13 years 11 months ago
Towards a Graphical Notation for OWL 2
The Ontology Definition Metamodel (ODM) defines a set of UML metamodels and profiles for development of RDF and OWL. The UML profiles in the ODM specification adapt UML notations t...
Elisa F. Kendall, Roy Bell, Roger Burkhart, Mark D...
JAR
2000
145views more  JAR 2000»
13 years 4 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 3 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
TSC
2010
133views more  TSC 2010»
13 years 3 months ago
Semantic-Based Mashup of Composite Applications
—The need for integration of all types of client and server applications that were not initially designed to interoperate is gaining popularity. One of the reasons for this popul...
Anne H. H. Ngu, Michael Pierre Carlson, Quan Z. Sh...