Sciweavers

2687 search results - page 113 / 538
» Formal Analysis of PKCS
Sort
View
MEMOCODE
2010
IEEE
15 years 1 months ago
Compilation of imperative synchronous programs with refined clocks
To overcome over-synchronization in synchronous programs, we recently introduced clock refinement to our synchronous programming language Quartz. This extension basically allows p...
Mike Gemunde, Jens Brandt, Klaus Schneider
CJ
2010
105views more  CJ 2010»
15 years 1 months ago
Efficient Semantic Information Exchange for Ambient Intelligence
This paper studies semantic efficiency measures for ambient intelligence. We follow an agent-based approach and investigate how large quantities of information can be efficiently ...
Jurriaan van Diggelen, Robbert-Jan Beun, Rogier M....
LPAR
2010
Springer
15 years 1 months ago
Verifying Pointer and String Analyses with Region Type Systems
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
Lennart Beringer, Robert Grabowski, Martin Hofmann
SAS
2010
Springer
134views Formal Methods» more  SAS 2010»
15 years 2 months ago
Strictness Meets Data Flow
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
Tom Schrijvers, Alan Mycroft
IFIP
2009
Springer
15 years 1 months ago
Model Checking of Security-Sensitive Business Processes
Security-sensitive business processes are business processes that must comply with security requirements (e.g. authorization constraints). In previous works it has been shown that ...
Alessandro Armando, Serena Elisa Ponta