Sciweavers

2236 search results - page 345 / 448
» Language Independence and Language Tolerance in Logic Progra...
Sort
View
ICALP
2004
Springer
15 years 9 months ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...
IFL
2007
Springer
162views Formal Methods» more  IFL 2007»
15 years 10 months ago
Testing Erlang Refactorings with QuickCheck
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...
Huiqing Li, Simon Thompson
APLAS
2004
ACM
15 years 9 months ago
Concurrency Combinators for Declarative Synchronization
Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronizatio...
Pawel T. Wojciechowski
ICLP
2003
Springer
15 years 9 months ago
Concurrency, Time, and Constraints
Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in...
Frank D. Valencia
ENTCS
2010
130views more  ENTCS 2010»
15 years 4 months ago
Compositional System Security with Interface-Confined Adversaries
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...