Sciweavers

7380 search results - page 1393 / 1476
» Engineering Software Intensive Systems
Sort
View
FOSSACS
2010
Springer
15 years 4 months ago
CIA Structures and the Semantics of Recursion
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
Stefan Milius, Lawrence S. Moss, Daniel Schwencke
FOSSACS
2009
Springer
15 years 4 months ago
Bisimulation for Demonic Schedulers
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...
Konstantinos Chatzikokolakis, Gethin Norman, David...
FOSSACS
2009
Springer
15 years 4 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong
CSE
2009
IEEE
15 years 4 months ago
Web Science 2.0: Identifying Trends through Semantic Social Network Analysis
—We introduce a novel set of social network analysis based algorithms for mining the Web, blogs, and online forums to identify trends and find the people launching these new tren...
Peter A. Gloor, Jonas Krauss, Stefan Nann, Kai Fis...
DSN
2009
IEEE
15 years 4 months ago
Decoupling Dynamic Information Flow Tracking with a dedicated coprocessor
Dynamic Information Flow Tracking (DIFT) is a promising security technique. With hardware support, DIFT prevents a wide range of attacks on vulnerable software with minimal perfor...
Hari Kannan, Michael Dalton, Christos Kozyrakis
« Prev « First page 1393 / 1476 Last » Next »