ENTCS 2008 - PDF Preprint Papers

ENTCS 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ENTCS-2008 Paper

click to vote

ENTCS
2008

390views more ENTCS 2008»

Cryptographic Versus Trust-based Methods for MANET Routing Security

13 years 11 months ago

Download www.cse.msstate.edu

Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without requiring a fixed infrastructure. Early routing protocols for MANETs failed to take security issues ...

Jared Cordasco, Susanne Wetzel

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	390	Cryptographic Versus Trust-based Methods for MANET Routing Security	claim
2	175	AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System	claim
3	170	A Coq Library for Verification of Concurrent Programs	claim
4	158	Aspect-Oriented Action Semantics Descriptions	claim
5	156	Schedulability Criteria and Analysis for Dynamic and Flexible Resource Management	claim
6	153	Observable Behavior of Dynamic Systems: Component Reasoning for Concurrent Objects	claim
7	153	Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs	claim
8	152	Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems	claim
9	150	Analyzing Security Scenarios Using Defence Trees and Answer Set Programming	claim
10	146	Complete Laziness: a Natural Semantics	claim
11	146	Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions	claim
12	146	An Application-Oriented Framework for Wireless Sensor Network Key Establishment	claim
13	144	Platform Independent Timing of Java Virtual Machine Bytecode Instructions	claim
14	142	Worst Case Reaction Time Analysis of Concurrent Reactive Programs	claim
15	142	An Open System Operational Semantics for an Object-Oriented and Component-Based Language	claim
16	140	Fusing a Transformation Language with an Open Compiler	claim
17	140	Functions and Lazy Evaluation in Prolog	claim
18	140	Higher-Order Separation Logic in Isabelle/HOLCF	claim
19	140	Linking Event-B and Concurrent Object-Oriented Programs	claim
20	139	Pervasive Compiler Verification - From Verified Programs to Verified Systems	claim
21	138	Compositionality of Statically Scheduled IP	claim
22	137	Computerizing Mathematical Text with MathLang	claim
23	136	A Virtual Machine Based Information Flow Control System for Policy Enforcement	claim
24	136	Multimodal Separation Logic for Reasoning About Operational Semantics	claim
25	135	Formal Specification Generation from Requirement Documents	claim
26	134	A Stack-Slicing Algorithm for Multi-Core Model Checking	claim
27	132	Distributed Verification of Multi-threaded C++ Programs	claim
28	132	A Meta Linear Logical Framework	claim
29	131	Connector Rewriting with High-Level Replacement Systems	claim
30	130	The SPARTA Pseudonym and Authorization System	claim
31	130	Semimodule Enrichment	claim
32	129	The York Abstract Machine	claim
33	128	Towards Formalizing Categorical Models of Type Theory in Type Theory	claim
34	128	Algebraic Stuttering Simulations	claim
35	127	HYPE Applied to the Modelling of Hybrid Biological Systems	claim
36	126	Admissibility of Cut in Coalgebraic Logics	claim
37	126	Comonadic Notions of Computation	claim
38	125	Can Refinement be Automated?	claim
39	125	Extending Lustre with Timeout Automata	claim
40	125	Quantum Arrows in Haskell	claim
41	124	Modular Games for Coalgebraic Fixed Point Logics	claim
42	124	Modular Functional Descriptions	claim
43	124	Stability for Effective Algebras	claim
44	123	A Chart Semantics for the Pi-Calculus	claim
45	123	A Multi-Core Solver for Parity Games	claim
46	122	Concurrency in Biological Modeling: Behavior, Execution and Visualization	claim
47	121	Building Certified Static Analysers by Modular Construction of Well-founded Lattices	claim
48	120	ConSpec - A Formal Language for Policy Specification	claim
49	120	Specifying and Executing Reactive Scenarios With Lutin	claim
50	120	Reasoning about B+ Trees with Operational Semantics and Separation Logic	claim
51	120	Separation Logic Semantics for Communicating Processes	claim
52	120	Semantic Abstraction and Quantum Computation	claim
53	120	Towards a Quantum Calculus: (Work in Progress, Extended Abstract)	claim
54	120	Stochastic Bigraphs	claim
55	120	Complementarity of Error Detection Techniques	claim
56	120	Characterizing Computable Analysis with Differential Equations	claim
57	119	An Example of Cloning Graph Transformation Rules for Programming	claim
58	118	Barbed Model-Driven Software Development: A Case Study	claim
59	118	Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences	claim
60	118	The STSLib Project: Towards a Formal Component Model Based on STS	claim
61	118	Shared Hash Tables in Parallel Model Checking	claim
62	116	A Bidirectional Refinement Type System for LF	claim
63	116	Computational Origami Construction as Constraint Solving and Rewriting	claim
64	116	Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents	claim
65	115	Time Separation of Events: An Inverse Method	claim
66	115	Branching Bisimulation Congruence for Probabilistic Systems	claim
67	114	Term-graph Rewriting in Tom Using Relative Positions	claim
68	114	Maintaining Coherence Between Models With Distributed Rules: From Theory to Eclipse	claim
69	113	Automatic Verification of Combined Specifications: An Overview	claim
70	113	A Model-Based Approach to the Verification and Adaptation of WF/.NET Components	claim
71	112	Residual for Component Specifications	claim
72	110	Chosen-name Attacks: An Overlooked Class of Type-flaw Attacks	claim
73	110	Performance Evaluation of Elastic GALS Interfaces and Network Fabric	claim
74	110	A New Proposal Of Quasi-Solved Form For Equality Constraint Solving	claim
75	110	Exploring an Option Space to Engineer a Ubiquitous Computing System	claim
76	110	Modelling Devices for Natural Interaction	claim
77	110	An Efficient Solution for Model Checking Graph Transformation Systems	claim
78	110	On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract)	claim
79	110	Game-Based Probabilistic Predicate Abstraction in PRISM	claim
80	109	Separation Logic for Multiple Inheritance	claim
81	109	Spatial Networks of Hybrid I/O Automata for Modeling Excitable Tissue	claim
82	109	Axiomatic Description of Mixed States From Selinger's CPM-construction	claim
83	108	E-matching for Fun and Profit	claim
84	108	Modelling Dynamic Software Architectures using Typed Graph Grammars	claim
85	106	Modelling Adaptive Systems in ForSyDe	claim
86	106	Reduction Semantics and Formal Analysis of Orc Programs	claim
87	106	Coequational Logic for Finitary Functors	claim
88	106	Towards a Sharing Strategy for the Graph Rewriting Calculus	claim
89	106	Towards Verifying Model Transformations	claim
90	106	Verifying Test-Hypotheses: An Experiment in Test and Proof	claim
91	106	Computability and Representations of the Zero Set	claim
92	105	Two-Level Hybrid: A System for Reasoning Using Higher-Order Abstract Syntax	claim
93	105	Development of a Modelica Compiler Using JastAdd	claim
94	105	An Abstract Analysis Framework for Synchronous Concurrent Languages based on source-to-source Transformation	claim
95	105	Checking Equivalence for Reo Networks	claim
96	105	Declaring Numbers	claim
97	104	A Logic for Virtual Memory	claim
98	103	Systematic Semantic Tableaux for PLTL	claim
99	103	Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking	claim
100	103	Analyzing Reachability for Some Petri Nets With Fast Growing Markings	claim
101	102	An Algebra for Directed Bigraphs	claim
102	102	Functorial Coalgebraic Logic: The Case of Many-sorted Varieties	claim
103	102	Programming Languages For Interactive Computing	claim
104	102	Soft Linear Logic and Polynomial Complexity Classes	claim
105	102	Encoding Distributed Process Calculi into LMNtal	claim
106	102	Towards a Systematic Method for Proving Termination of Graph Transformation Systems	claim
107	102	A Monotonicity Principle for Information Theory	claim
108	102	A Case Study in Parallel Verification of Component-Based Systems	claim
109	101	Imperative LF Meta-Programming	claim
110	101	Hedaquin: A Reputation-based Health Data Quality Indicator	claim
111	101	Normalization for the Simply-Typed Lambda-Calculus in Twelf	claim
112	101	Rewriting Strategies in Java	claim
113	101	Improving Fault-based Conformance Testing	claim
114	101	Model Checking Quantitative Linear Time Logic	claim
115	101	On the Approximation of Stochastic Concurrent Constraint Programming by Master Equation	claim
116	101	Monotonic Abstraction in Parameterized Verification	claim
117	100	A Calculus for Team Automata	claim
118	100	Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi	claim
119	100	Implementing an EJB3-Specific Graph Transformation Plugin by Using Database Independent Queries	claim
120	100	On Challenges for a Graphical Transformation Notation and the UMLX Approach	claim
121	99	Specifying Properties of Concurrent Computations in CLF	claim
122	99	SPPF-Style Parsing From Earley Recognisers	claim
123	99	Visual Specification of Metrics for Domain Specific Visual Languages	claim
124	99	ArcAngelC: a Refinement Tactic Language for Circus	claim
125	99	A Categorical Model of the Fusion Calculus	claim
126	99	Modelling Intracellular Fate of FGF Receptors With BioAmbients	claim
127	98	Modifying Contracts with Larissa Aspects	claim
128	98	Modal Expressiveness of Graph Properties	claim
129	98	Graph Transformation Semantics for a QVT Language	claim
130	98	An Intermediate Language for the Simulation of Biological Systems	claim
131	98	A Rewriting Calculus for Multigraphs with Ports	claim
132	98	On Finite-time Computability Preserving Conversions	claim
133	97	Meta-programming With Built-in Type Equality	claim
134	97	Termination of Lazy Rewriting Revisited	claim
135	97	An Algorithm for Approximating the Satisfiability Problem of High-level Conditions	claim
136	97	Structured Types and Separation Logic	claim
137	97	POVMs and Naimark's Theorem Without Sums	claim
138	97	Global State Considered Helpful	claim
139	97	Parallel Model Checking Large-Scale Genetic Regulatory Networks with DiVinE	claim
140	97	Performance of Reactive Interfaces in Stimulus Rich Environments, Applying Formal Methods and Cognitive Frameworks	claim
141	97	Coordination Models Orc and Reo Compared	claim
142	96	Maude as a Platform for Designing and Implementing Deep Inference Systems	claim
143	96	Undecidability of Model Checking in Brane Logic	claim
144	95	An Experimental Ambiguity Detection Tool	claim
145	95	A Formal Framework for Interactive Agents	claim
146	95	Generic Tools via General Refinement	claim
147	95	A Rule-based Method to Match Software Patterns Against UML Models	claim
148	95	Coverage-biased Random Exploration of Models	claim
149	94	Monitoring External Resources in Java MIDP	claim
150	94	A Logical Framework with Explicit Conversions	claim
151	94	Expressiveness of Process Algebras	claim
152	94	A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System Code	claim
153	94	From Reversible to Irreversible Computations	claim
154	94	On the Convergence of Reduction-based and Model-based Methods in Proof Theory	claim
155	93	Rewriting Interpolants	claim
156	92	Redundancy Elimination for LF	claim
157	92	A Process Model of Rho GTP-binding Proteins in the Context of Phagocytosis	claim
158	91	Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems	claim
159	91	Implementing Real Numbers With RZ	claim
160	91	Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra	claim
161	91	A Name Abstraction Functor for Named Sets	claim
162	91	Towards Concrete Syntax Patterns for Logic-based Transformation Rules	claim
163	90	A Database Approach to Distributed State Space Generation	claim
164	90	Ensuring the Correctness of Lightweight Tactics for JavaCard Dynamic Logic	claim
165	90	Instantaneous Transitions in Esterel	claim
166	90	Quantum Data and Control Made Easier	claim
167	90	Formal Verification of Websites	claim
168	89	CC(X): Semantic Combination of Congruence Closure with Solvable Theories	claim
169	89	Dataflow Architectures for GALS	claim
170	89	On the Relationship between Filter Spaces and Weak Limit Spaces	claim
171	89	Undecidable Properties on Length-Two String Rewriting Systems	claim
172	89	A Quantum Game Semantics for the Measurement Calculus	claim
173	89	Relational Analysis and Precision via Probabilistic Abstract Interpretation	claim
174	88	Formal Modelling of Salience and Cognitive Load	claim
175	88	Behavior-Preserving Simulation-to-Animation Model and Rule Transformations	claim
176	88	Specification of Conditions for Error Diagnostics	claim
177	87	Remote Attestation on Legacy Operating Systems With Trusted Platform Modules	claim
178	87	Integral of Fine Computable functions and Walsh Fourier series	claim
179	87	Checking Emptiness of Non-Deterministic Regular Types with Set Operators	claim
180	87	Process Algebra with Local Communication	claim
181	87	The Complexity of Satisfiability for Fragments of CTL and CTL*	claim
182	87	A Lightweight Approach for the Semantic Validation of Model Refinements	claim
183	86	Game Semantics for Quantum Stores	claim
184	85	Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking	claim
185	85	Connectivity Properties of Dimension Level Sets	claim
186	85	Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems	claim
187	85	Innermost Termination of Rewrite Systems by Labeling	claim
188	85	Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers	claim
189	85	General Refinement, Part One: Interfaces, Determinism and Special Refinement	claim
190	85	Reachability in Petri Nets with Inhibitor Arcs	claim
191	85	Dynamic Slicing Techniques for Petri Nets	claim
192	84	Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems	claim
193	84	Comparing Three Coordination Models: Reo, ARC, and RRD	claim
194	83	Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus	claim
195	83	Infrastructural Support for Enforcing and Managing Distributed Application-Level Policies	claim
196	83	Elastic Flow in an Application Specific Network-on-Chip	claim
197	83	Controlling Control Flow in Web Applications	claim
198	83	Executable Specifications for Real-Time Distributed Systems	claim
199	83	Dynamic Translucency with Abstraction Kinds and Higher-Order Coercions	claim
200	83	A Coalgebraic Theory of Reactive Systems	claim
201	82	A Static Analysis for Beta-Binders	claim
202	81	Encoding First Order Proofs in SMT	claim
203	81	Signature Compilation for the Edinburgh Logical Framework	claim
204	81	Computational Soundness of a Call by Name Calculus of Recursively-scoped Records	claim
205	81	Efficient Stochastic Simulation of Biological Systems with Multiple Variable Volumes	claim
206	81	Presenting Dcpos and Dcpo Algebras	claim
207	80	Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs	claim
208	80	A Rule-Based, Integrated Modelling Approach for Object-Oriented Systems	claim
209	80	Locality of Corner Transformation for Multidimensional Spatial Access Methods	claim
210	80	Alloy as a Refactoring Checker?	claim
211	80	Idempotents in Dagger Categories: (Extended Abstract)	claim
212	79	Tensors of Comodels and Models for Operational Semantics	claim
213	79	Experimenting Formal Proofs of Petri Nets Refinements	claim
214	79	j-POST: a Java Toolchain for Property-Oriented Software Testing	claim
215	79	The Compositional Method and Regular Reachability	claim
216	78	The lambda-context Calculus	claim
217	78	Merging Hierarchically-Structured Documents in Workflow Systems	claim
218	78	Silver: an Extensible Attribute Grammar System	claim
219	78	The Role of Visual Modeling and Model Transformations in Business-driven Development	claim
220	78	Pre-Galois Connection on Coalgebras for Generic Component Refinement	claim
221	77	A Comparative Study of Industrial Static Analysis Tools	claim
222	76	Computable Riesz Representation for Locally Compact Hausdorff Spaces	claim
223	76	Symbolic and Abstract Interpretation for C/C++ Programs	claim
224	75	Focusing the Inverse Method for LF: A Preliminary Report	claim
225	75	Vulnerabilities in Anonymous Credential Systems	claim
226	75	Timed Specification For Web Services Compatibility Analysis	claim
227	75	On the Refinement of Atomic Actions	claim
228	75	Intensional Properties of Polygraphs	claim
229	75	Minimality in a Linear Calculus with Iteration	claim
230	74	Matching Systems for Concurrent Calculi	claim
231	74	An RDF Query Language based on Logic Programming	claim
232	73	Invariants for Non-Hierarchical Object Structures	claim
233	73	Observational Coalgebras and Complete Sets of Co-operations	claim
234	73	Oracle-Based Partial Evaluation	claim
235	72	Coalgebraising Subsequential Transducers	claim
236	72	Towards a Notion of Transaction in Graph Rewriting	claim
237	71	Implementing a Domain-Specific Language Using Stratego/XT: An Experience Paper	claim
238	71	An Inverse Method for Parametric Timed Automata	claim
239	70	Separate Compilation of Polychronous Specifications	claim
240	70	A Characterization of Constructive Dimension	claim
241	70	Spatial Differentiation and Positive Circuits in a Discrete Framework	claim
242	69	A New Proposal for Debugging Datalog Programs	claim
243	68	A Technique for Verifying Measurements	claim
244	68	The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems	claim
245	67	Notions of Probabilistic Computability on Represented Spaces	claim
246	67	Copying Subgraphs Within Model Repositories	claim
247	66	Measuring and Evaluating Parallel State-Space Exploration Algorithms	claim
248	65	Grammar Engineering Support for Precedence Rule Recovery and Compatibility Checking	claim
249	65	Rules and Strategies in Java	claim
250	65	Proofs as Polynomials	claim
251	64	Model-based Theory Combination	claim
252	64	Service Discovery and Negotiation With COWS	claim
253	64	General Refinement, Part Two: Flexible Refinement	claim
254	64	Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach	claim
255	64	A Hierarchy of Quantum Semantics	claim
256	62	Undecidable Control Conditions in Graph Transformation Units	claim
257	61	Maude Object-Oriented Action Tool	claim
258	59	A Model Checking Approach to Protocol Conversion	claim
259	59	A Parametric Calculus for Mobile Open Code	claim
260	57	Falsifying Safety Properties Through Games on Over-approximating Models	claim
261	56	Hard combinators	claim
262	50	A Game Theoretic Approach to the Analysis of Dynamic Networks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers