ENTCS 2007 - PDF Preprint Papers

ENTCS 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ENTCS-2007 Paper

click to vote

ENTCS
2007

199views more ENTCS 2007»

Heuristics for Safety and Security Constraints

14 years 12 days ago

Download www2.imm.dtu.dk

The ﬂow logic approach to static analysis amounts to specifying the admissibility of solutions to analysis problems; when speciﬁed using formulae in stratiﬁed alternation-fr...

Flemming Nielson, Hanne Riis Nielson

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	199	Heuristics for Safety and Security Constraints	claim
2	190	Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming	claim
3	182	Automated Fault Localization for C Programs	claim
4	178	Recent Advances in Real-Time Maude	claim
5	174	Quantum Patterns and Types for Entanglement and Separability	claim
6	171	A Certifying Code Generation Phase	claim
7	168	Bytecode Rewriting in Tom	claim
8	161	Bialgebraic Methods in Structural Operational Semantics: Invited Talk	claim
9	159	Almost Every Domain is Universal	claim
10	158	Abstraction and Completeness for Real-Time Maude	claim
11	156	Bounded Model Checking with Parametric Data Structures	claim
12	153	The Methods of Approximation and Lifting in Real Computation	claim
13	151	Coalgebraic Modal Logic Beyond Sets	claim
14	150	On the Expressiveness of Mobile Synchronizing Petri Nets	claim
15	145	Design, Analysis and Performance Evaluation of Group Key Establishment in Wireless Sensor Networks	claim
16	144	Partial Order Reduction for Rewriting Semantics of Programming Languages	claim
17	143	Formal Fault Tree Analysis - Practical Experiences	claim
18	141	Compressing BMC Encodings with QBF	claim
19	140	Admissible Representations of Probability Measures	claim
20	140	Secured Information Flow for Asynchronous Sequential Processes	claim
21	139	A Change-based Approach to Software Evolution	claim
22	137	Formal Sequentialization of Distributed Systems via Program Rewriting	claim
23	136	Adaptation for Hierarchical Components and Services	claim
24	135	Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems	claim
25	134	A Compact Linear Translation for Bounded Model Checking	claim
26	134	Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation	claim
27	133	Modelchecking Correctness of Refactorings - Some Experiments	claim
28	132	The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads	claim
29	132	Building Reputations for Internet Clients	claim
30	131	Architecting Fault-tolerant Component-based Systems: from requirements to testing	claim
31	131	Secure Node Discovery in Ad-hoc Networks and Applications	claim
32	130	Specify, Compile, Run: Hardware from PSL	claim
33	129	Protocol Composition Logic (PCL)	claim
34	128	Rewriting-Based Access Control Policies	claim
35	128	Optimisation Validation	claim
36	126	Notes on Generative Probabilistic Bisimulation	claim
37	126	Nominal Reasoning Techniques in Coq: (Extended Abstract)	claim
38	126	Modelling Calculi with Name Mobility using Graphs with Equivalences	claim
39	126	Context Dependent Procedures and Computed Types in -eriFun	claim
40	124	Structuring Optimizing Transformations and Proving Them Sound	claim
41	124	Blues for Gary: Design Abstractions for a Jazz Improvisation Assistant	claim
42	123	Labelled Markov Processes as Generalised Stochastic Relations	claim
43	123	Proving Termination of Context-Sensitive Rewriting with MU-TERM	claim
44	122	Plugging a Space Leak with an Arrow	claim
45	121	Audit-Based Access Control for Electronic Health Records	claim
46	121	Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract)	claim
47	121	An Account of Implementing Applicative Term Rewriting	claim
48	121	Rewrite-Based Decision Procedures	claim
49	121	Incremental Parametric Development of Greedy Algorithms	claim
50	120	Local Reasoning about Data Update	claim
51	120	A Framework for Interpreting Traces of Functional Logic Computations	claim
52	120	Non-Interference Control Synthesis for Security Timed Automata	claim
53	119	Interpolant Learning and Reuse in SAT-Based Model Checking	claim
54	119	PML: Toward a High-Level Formal Language for Biological Systems	claim
55	118	Safe Adaptation of Component Coordination	claim
56	117	Relating Hybrid Chi to Other Formalisms	claim
57	116	A Logical Characterisation of Static Equivalence	claim
58	116	DisCComp - A Formal Model for Distributed Concurrent Components	claim
59	116	Co-Algebraic Models for Quantitative Spatial Logics	claim
60	116	Experiments in Cost Analysis of Java Bytecode	claim
61	116	Handling Model Changes: Regression Testing and Test-Suite Update with Model-Checkers	claim
62	115	Self Management and the Future of Software Design	claim
63	115	A Global Algorithm for Model-Based Test Suite Generation	claim
64	114	Active Evaluation Contexts for Reaction Semantics	claim
65	114	Reporting Failures in Functional Logic Programs	claim
66	114	A Graph Abstract Machine Describing Event Structure Composition	claim
67	114	Parametric Performance Contracts for Software Components with Concurrent Behaviour	claim
68	113	A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F	claim
69	113	Quantum Programming With Mixed States	claim
70	113	The Interactive Curry Observation Debugger iCODE	claim
71	113	Modular Checkpointing for Atomicity	claim
72	113	On the Decidability of the Safety Problem for Access Control Policies	claim
73	112	A Holistic Approach to Security Policies - Policy Distribution with XACML over COPS	claim
74	112	Structure and Properties of Traces for Functional Programs	claim
75	112	A Calculus of Global Interaction based on Session Types	claim
76	111	Compositional State Space Reduction Using Untangled Actions	claim
77	111	Extra Variables Can Be Eliminated from Functional Logic Programs	claim
78	111	Reversibility and Models for Concurrency	claim
79	111	Multi Labelled Transition Systems: A Semantic Framework for Nominal Calculi	claim
80	110	Data Anonymity in the FOO Voting Scheme	claim
81	110	Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks	claim
82	110	A Bayesian Model for Event-based Trust	claim
83	109	Modular Structural Operational Semantics with Strategies	claim
84	109	Hybrid Logics and Ontology Languages	claim
85	109	Free Theorems and Runtime Type Representations	claim
86	109	Constructive Membership Predicates as Index Types	claim
87	109	Symbolic Model Checking for Channel-based Component Connectors	claim
88	109	Improving the Context-sensitive Dependency Graph	claim
89	108	Simulating and Compiling Code for the Sequential Quantum Random Access Machine	claim
90	108	Remarks on Testing Probabilistic Processes	claim
91	108	The Bicategory-Theoretic Solution of Recursive Domain Equations	claim
92	108	Termination Criteria for DPO Transformations with Injective Matches	claim
93	108	An Adaptation-based Approach to Incrementally Build Component Systems	claim
94	108	Generating Java Compiler Optimizers Using Bidirectional CTL	claim
95	107	Event Domains, Stable Functions and Proof-Nets	claim
96	107	Dynamic Contextual Adaptation	claim
97	107	Modeling Environment for Component Model Checking from Hierarchical Architecture	claim
98	107	Applications = Components + GLoo	claim
99	107	Formal Translation of Bytecode into BoogiePL	claim
100	107	Executable Grammars in Newspeak	claim
101	106	Program and Algorithm Visualization in Engineering and Physics	claim
102	106	A Proposal for the Cooperation of Solvers in Constraint Functional Logic Programming	claim
103	105	Narrowing and Rewriting Logic: from Foundations to Applications	claim
104	105	A Structural Approach for Modelling Performance of Systems Using Skeletons	claim
105	105	A Probabilistic Scheduler for the Analysis of Cryptographic Protocols	claim
106	104	Automated Techniques for Surviving (Otherwise) Fatal Software Errors	claim
107	104	An Algebra of Pure Quantum Programming	claim
108	104	Amb Breaks Well-Pointedness, Ground Amb Doesn't	claim
109	104	Lazy Context Cloning for Non-Deterministic Graph Rewriting	claim
110	104	Algorithmic Debugging of Java Programs	claim
111	104	General Reversibility	claim
112	104	A Formal Framework for Web Services Coordination	claim
113	104	Implementing a Distributed Mobile Calculus Using the IMC Framework	claim
114	104	Exogenous Probabilistic Computation Tree Logic	claim
115	103	Static Slicing of Rewrite Systems	claim
116	103	Policy-based Coordination in PAGODA: A Case Study	claim
117	102	Selective Data Encryption in Outsourced Dynamic Environments	claim
118	102	Encoding Functional Relations in Scunak	claim
119	102	Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions	claim
120	101	Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic	claim
121	101	Semantic Determinism and Functional Logic Program Properties	claim
122	101	Parametric Performance Contracts: Non-Markovian Loop Modelling and an Experimental Evaluation	claim
123	101	From Functional Programs to Interaction Nets via the Rewriting Calculus	claim
124	101	Solving Sudoku Puzzles with Rewriting Rules	claim
125	101	Model-checking Distributed Components: The Vercors Platform	claim
126	101	Compressing Propositional Refutations	claim
127	101	A Framework for Timed Concurrent Constraint Programming with External Functions	claim
128	101	Inequational Deduction as Term Graph Rewriting	claim
129	100	Using Template Haskell for Abstract Interpretation	claim
130	100	Concurrent Logic and Automata Combined: A Semantics for Components	claim
131	100	Lightweight Static Capabilities	claim
132	100	Type-Safe Code Transformations in Haskell	claim
133	100	Extensionality of Spatial Observations in Distributed Systems	claim
134	100	JOLIE: a Java Orchestration Language Interpreter Engine	claim
135	99	A Behavioural Model for Klop's Calculus	claim
136	99	Nominal Equational Logic	claim
137	99	Extending Symmetry Reduction Techniques to a Realistic Model of Computation	claim
138	98	Event Structures with Symmetry	claim
139	98	Evaluating Complex MAC Protocols for Sensor Networks with APMC	claim
140	98	Type Systems for Optimizing Stack-based Code	claim
141	98	Frameworks Based on Templates for Rigorous Model-driven Development	claim
142	98	A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle	claim
143	97	A Process Algebra for Reasoning About Quantum Security	claim
144	97	Skeletons, Homomorphisms, and Shapes: Characterizing Protocol Executions	claim
145	97	A Head-to-Head Comparison of de Bruijn Indices and Names	claim
146	97	Safety-Oriented Design of Component Assemblies using Safety Interfaces	claim
147	97	Can a Model Checker Generate Tests for Non-Deterministic Systems?	claim
148	97	Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems	claim
149	97	An Operational Semantics for Shared Messaging Communication	claim
150	96	Cryptographic Pattern Matching	claim
151	96	An Observational Theory for Mobile Ad Hoc Networks	claim
152	96	A List-machine Benchmark for Mechanized Metatheory: (Extended Abstract)	claim
153	96	Deduction, Strategies, and Rewriting	claim
154	96	Synchrony vs Asynchrony in Communication Primitives	claim
155	96	Semantics of Biological Regulatory Networks	claim
156	95	Rijndael for Sensor Networks: Is Speed the Main Issue?	claim
157	95	Hybridizing a Logical Framework	claim
158	95	Handshake Games	claim
159	95	MMC: the Mono Model Checker	claim
160	95	A Rewriting Logic Approach to Operational Semantics (Extended Abstract)	claim
161	94	On the Security of Tag-KEM for Signcryption	claim
162	94	Intruder Deduction for the Equational Theory of Exclusive-or with Commutative and Distributive Encryption	claim
163	94	Membrane Systems with Marked Membranes	claim
164	94	Virtual Organizations in Arigatoni	claim
165	94	Matching of Bigraphs	claim
166	94	A Distributed Implementation of Mobile Maude	claim
167	93	Modeling Pointer Redirection as Cyclic Term-graph Rewriting	claim
168	93	Types for Access Control in a Calculus of Mobile Resources	claim
169	92	The MoR-Trust Distributed Trust Management System: Design and Simulation Results	claim
170	92	A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs	claim
171	91	A Cappable Almost Everywhere Dominating Computably Enumerable Degree	claim
172	91	Rule-Based Operational Semantics for an Imperative Language	claim
173	91	Dynamic Reverse Code Generation for Backward Execution	claim
174	91	A Logic for Reasoning about Generic Judgments	claim
175	91	Timed Concurrent Constraint Programming for Analysing Biological Systems	claim
176	91	Towards a Coordination Model for Interactive Systems	claim
177	91	Stochastic Concurrent Constraint Programming and Differential Equations	claim
178	90	Establishment of Ad-Hoc Communities through Policy-Based Cryptography	claim
179	90	Extracting Program Logics From Abstract Interpretations Defined by Logical Relations	claim
180	90	Undecidability of Multi-modal Hybrid Logics	claim
181	90	Model-checking Driven Design of Interactive Systems	claim
182	89	Quantum Programs With Classical Output Streams: (Extended Abstract)	claim
183	89	Hierarchical Nominal Terms and Their Theory of Rewriting	claim
184	89	Weak Probabilistic Anonymity	claim
185	89	A Well-behaved LTS for the Pi-calculus: (Abstract)	claim
186	89	Measuring a Java Test Suite Coverage Using JML Specifications	claim
187	88	A Linear-time Tissue P System Based Solution for the 3-coloring Problem	claim
188	88	Mothers of Pipelines	claim
189	88	Behavioural Types for Service Integration: Achievements and Challenges	claim
190	88	Keeping Secrets in Resource Aware Components	claim
191	87	Aspect-orientation For Revitalising Legacy Business Software	claim
192	87	A Study on the Practicality of Poly-Controlled Partial Evaluation	claim
193	87	Temporal Logics of Knowledge and their Applications in Security	claim
194	87	A Congruence Rule Format with Universal Quantification	claim
195	86	Sequentiality and the CPS Semantics of Fresh Names	claim
196	86	Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures	claim
197	86	On the Non-sequential Nature of Domain Models of Real-number Computation	claim
198	86	Tinycals: Step by Step Tacticals	claim
199	86	Tool Support for Proof Engineering	claim
200	86	Programmed Search in a Timetabling Problem over Finite Domains	claim
201	86	Equational Cryptographic Reasoning in the Maude-NRL Protocol Analyzer	claim
202	86	Rewrite-Based Satisfiability Procedures for Recursive Data Structures	claim
203	86	Simulations Up-to and Canonical Preorders: (Extended Abstract)	claim
204	85	Model-driven Transformation-based Generation of Java Stress Tests	claim
205	85	Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities	claim
206	85	Proving Approximate Implementations for Probabilistic I/O Automata	claim
207	85	A Simple Sequential Reasoning Approach for Sound Modular Verification of Mainstream Multithreaded Programs	claim
208	85	Automatic Verification of Bossa Scheduler Properties	claim
209	85	The GTO Toolset and Method	claim
210	85	Stochastic Modelling of Communication Protocols from Source Code	claim
211	85	Towards Software Component Procurement Automation with Latent Semantic Analysis	claim
212	85	On-the-Fly Data Flow Analysis Based on Verification Technology	claim
213	84	An Eclipse-based Integrated Environment for Developing Executable Structural Operational Semantics Specifications	claim
214	84	Preface and Foreword	claim
215	84	A Rewriting Logic Framework for Soft Constraints	claim
216	84	Inductive Reasoning and Programming Visualization, an Experiment Proposal	claim
217	84	Prototype Platforms for Distributed Agreements	claim
218	83	On Dynamic Distribution of Private Keys over MANETs	claim
219	83	Enhancing Theorem Prover Interfaces with Program Slice Information	claim
220	83	A Local Graph-rewriting System for Deciding Equality in Sum-product Theories	claim
221	83	An Integrated and "Engaging" Package for Tree Animations	claim
222	83	ReSpecT Nets: Towards an Analysis Methodology for ReSpecT Specifications	claim
223	82	Syntactic Logical Relations for Polymorphic and Recursive Types	claim
224	82	Web Interfaces for Proof Assistants	claim
225	82	On the Computational Representation of Classical Logical Connectives	claim
226	82	A Simple Calculus for Proteins and Cells	claim
227	82	Animation Metaphors for Object-Oriented Concepts	claim
228	81	Self-assembling Trees	claim
229	81	Error Diagnosis in Equivalence Checking of High Performance Microprocessors	claim
230	80	Mixed Rational Assessments of Possibility and Probability Measures	claim
231	80	Relational Parametricity for Control Considered as a Computational Effect	claim
232	80	Topological Perspective on the Hybrid Proof Rules	claim
233	80	Combining Product Lines and Model-Based Development	claim
234	80	SAT-based Abstraction Refinement for Real-time Systems	claim
235	79	Higher-Order Syntax and Saturation Algorithms for Hybrid Logic	claim
236	79	Fault Detection in Multi-Threaded C++ Server Applications	claim
237	79	Towards Trustworthy Spatial Messaging	claim
238	78	PEPA Queues: Capturing Customer Behaviour in Queueing Networks	claim
239	77	Software Evolution from the Field: An Experience Report from the Squeak Maintainers	claim
240	75	Maude MSOS Tool	claim
241	75	Testing Planning Domains (without Model Checkers)	claim
242	74	On Well-Foundedness and Expressiveness of Promoted Tyft: Being Promoted Makes a Difference	claim
243	74	A Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters	claim
244	74	State-oriented Noninterference for CCS	claim
245	73	What You Lose is What You Leak: Information Leakage in Declassification Policies	claim
246	73	Towards Multiple Access in Generic Component Architectures	claim
247	73	Language-Oriented Formal Analysis: a Case Study on Protocols and Distributed Systems	claim
248	73	Towards the Integration of Visual and Formal Models for GUI Testing	claim
249	72	Pauli Measurements are Universal	claim
250	72	Observational Equivalence for the Interaction Combinators and Internal Separation	claim
251	72	Equivalence of Two Formal Semantics for Functional Logic Programs	claim
252	71	Building Verification Condition Generators by Compositional Extension	claim
253	70	De-linearizing Linearity: Projective Quantum Axiomatics From Strong Compact Closure	claim
254	70	Distributed Measurement-based Quantum Computation	claim
255	70	Component Substitutability via Equivalencies of Component-Interaction Automata	claim
256	69	Modal Logic Characterization of Markovian Testing and Trace Equivalences	claim
257	69	Bi-inductive Structural Semantics: (Extended Abstract)	claim
258	68	Modelling Generic Judgements	claim
259	68	PVS#: Streamlined Tacticals for PVS	claim
260	67	An Orchestrator for Dynamic Interconnection of Software Components	claim
261	65	Effective Randomness for Computable Probability Measures	claim
262	63	Conformal Field Theory as a Nuclear Functor	claim
263	50	Translation Templates to Support Strategy Development in PVS	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers