Sciweavers

3335 search results - page 288 / 667
» Grid result checking
Sort
View
FUIN
2007
99views more  FUIN 2007»
15 years 6 months ago
Verifying Security Protocols Modelled by Networks of Automata
In this paper we show a novel method for modelling behaviours of security protocols using networks of communicating automata in order to verify them with SAT-based bounded model ch...
Miroslaw Kurkowski, Wojciech Penczek
ARSCOM
2002
53views more  ARSCOM 2002»
15 years 6 months ago
Embedding Graphs Containing K5-Subdivisions
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partit...
Andrei V. Gagarin, William Kocay
LOGCOM
2010
96views more  LOGCOM 2010»
15 years 5 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
IPPS
2010
IEEE
15 years 4 months ago
Ensuring deterministic concurrency through compilation
Abstract--Multicore shared-memory architectures are becoming prevalent but bring many programming challenges. Among the biggest is non-determinism: the output of the program does n...
Nalini Vasudevan, Stephen A. Edwards
EJWCN
2010
119views more  EJWCN 2010»
15 years 1 months ago
Embedding Protection Inside H.264/AVC and SVC Streams
into the H.264 bitstream of supplementary network abstraction layer (NAL) units that contain forward error-correction (FEC) data generated by a block error-correction code. The pro...
Catherine Lamy-Bergot, Benjamin Gadat