ENTCS 2006 - PDF Preprint Papers

ENTCS 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ENTCS-2006 Paper

click to vote

ENTCS
2006

1305views more ENTCS 2006»

Communication Attitudes: A Formal Approach to Ostensible Intentions, and Individual and Group Opinions

13 years 11 months ago

Download www.personeel.unimaas.nl

Conventional approaches to the modeling of autonomous agents and agent communication rely heavily on the ascription of mental properties like beliefs and intentions to the individ...

Matthias Nickles, Felix A. Fischer, Gerhard Wei&sz...

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	1305	Communication Attitudes: A Formal Approach to Ostensible Intentions, and Individual and Group Opinions	claim
2	339	A Short Visit to the STS Hierarchy	claim
3	273	Operator Algebras and the Operational Semantics of Probabilistic Languages	claim
4	231	SaveCCM: An Analysable Component Model for Real-Time Systems	claim
5	214	A Generalization of ACP Using Belnap's Logic	claim
6	213	Building Components from Functions	claim
7	206	An Overview of Semantic Web Services Composition Approaches	claim
8	199	Compositional Operational Semantics of a UML-Kernel-Model Language	claim
9	192	Model Transformation From VisualOCL to OCL Using Graph Transformation	claim
10	189	Variables as Resource for Shared-Memory Programs: Semantics and Soundness	claim
11	185	Time Domain Verification of Oscillator Circuit Properties	claim
12	184	Scannerless Boolean Parsing	claim
13	183	Metamodel-Based Model Transformation with Aspect-Oriented Constraints	claim
14	181	Conditional Doxastic Models: A Qualitative Approach to Dynamic Belief Revision	claim
15	180	Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems	claim
16	176	Automatic Formal Synthesis of Hardware from Higher Order Logic	claim
17	176	Gauss: A Framework for Verifying Scientific Computing Software	claim
18	175	Observing Internet Worm and Virus Attacks with a Small Network Telescope	claim
19	175	A Semantical Framework for the Orchestration and Choreography of Web Services	claim
20	174	Context Sequence Matching for XML	claim
21	174	Symbolic Reasoning with Weighted and Normalized Decision Diagrams	claim
22	173	Formal Security Analysis for Ad-Hoc Networks	claim
23	173	Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata	claim
24	172	Efficient Detection of Conflicts in Graph-based Model Transformation	claim
25	172	Locality of Queries and Transformations	claim
26	171	Program Extraction From Proofs of Weak Head Normalization	claim
27	169	Constructing Induction Rules for Deductive Synthesis Proofs	claim
28	168	A Functional Programming Framework for Latency Insensitive Protocol Validation	claim
29	168	Case Study: Model Transformations for Time-triggered Languages	claim
30	166	Arrows, like Monads, are Monoids	claim
31	164	Adaptive Medical Workflow Management for a Context-Dependent Home Healthcare Assistance Service	claim
32	163	Design Challenges for a Differential-Power-Analysis Aware GALS-based AES Crypto ASIC	claim
33	162	Adaptive Graph Pattern Matching for Model Transformations using Model-sensitive Search Plans	claim
34	162	Continuous Functions on Final Coalgebras	claim
35	161	Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation	claim
36	161	Tool Building Requirements for an API to First-Order Solvers	claim
37	161	Architecture Normalization for Component-based Systems	claim
38	161	Algebraic Specification and Coalgebraic Synthesis of Mealy Automata	claim
39	160	Checking and Correcting Behaviors of Java Programs at Runtime with Java-MOP	claim
40	159	Approximations of Modal Logic K	claim
41	158	Connector Colouring I: Synchronisation and Context Dependency	claim
42	158	Towards a Subject-Oriented Model-Driven Framework	claim
43	157	Analysing the Robustness of Surfing Circuits	claim
44	156	Computational Effects in Topological Domain Theory	claim
45	155	Biomolecular Agents as Multi-behavioural Concurrent Objects	claim
46	155	Mathematical Service Trading Based on Equational Matching	claim
47	154	PMaude: Rewrite-based Specification Language for Probabilistic Object Systems	claim
48	154	Applying a Model Transformation Taxonomy to Graph Transformation Technology	claim
49	154	Quantitative Static Analysis Over Semirings: Analysing Cache Behaviour for Java Card	claim
50	153	Multi-Agent System Development Based on Organizations	claim
51	153	Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus	claim
52	153	Towards Model Transformation in Generated Eclipse Editor Plug-Ins	claim
53	153	Automatic Complexity Analysis for Programs Extracted from Coq Proof	claim
54	151	Stochastic Simulation Methods Applied to a Secure Electronic Voting Model	claim
55	151	Extending C for Checking Shape Safety	claim
56	150	Causality Versus True-Concurrency	claim
57	148	Towards the Semantics and Verification of BPEL4WS	claim
58	146	An Abstract Way to Define Rewriting Logic	claim
59	146	Strong Update, Disposal, and Encapsulation in Bunched Typing	claim
60	146	Formalizing WSBPEL Business Processes Using Process Algebra	claim
61	146	Relating State-Based and Process-Based Concurrency through Linear Logic	claim
62	145	Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof	claim
63	145	Compositionality of Security Protocols: A Research Agenda	claim
64	145	A Calculus for Data Mapping	claim
65	145	A Classification of Time and/or Probability Dependent Security Properties	claim
66	145	Cooperation-based Invariants for OO Languages	claim
67	145	Automated Derivation of Translators From Annotated Grammars	claim
68	144	Contorsion: A Semantic XPath Processor	claim
69	144	Infinitary Howe's Method	claim
70	143	Hiproofs: A Hierarchical Notion of Proof Tree	claim
71	143	Component-Oriented Specification of Performance Measures	claim
72	142	Specialization of Interaction Protocols in a Temporal Action Logic	claim
73	142	Predicate Diagrams for the Verification of Real-Time Systems	claim
74	142	The Rewriting Logic Semantics Project	claim
75	141	A Concurrent Model for Linear Logic	claim
76	141	Refining the Undecidability Border of Weak Bisimilarity	claim
77	141	Verification of Distributed Hierarchical Components	claim
78	141	Abstract Families of Abstract Categorial Languages	claim
79	140	A Library for Self-Adjusting Computation	claim
80	140	A Web Service Architecture for Enforcing Access Control Policies	claim
81	140	An Aspect-Oriented Approach to Modular Behavioral Specification	claim
82	140	Stochastic Ambient Calculus	claim
83	139	Analytical Modeling for Operating System Schedulers on NUMA Systems	claim
84	139	Goto and Concurrency Introducing Safe Jumps in Esterel	claim
85	139	Improving the Usability of a Graph Transformation Language	claim
86	139	AspectLISA: An Aspect-oriented Compiler Construction System Based on Attribute Grammars	claim
87	138	Variables as Resource in Separation Logic	claim
88	138	Model Checking Russian Cards	claim
89	138	Some Properties and Some Problems on Set Functors	claim
90	138	Propositional Games with Explicit Strategies	claim
91	137	Compiling Esterel into Static Discrete-Event Code	claim
92	137	Coalgebraic Description of Generalized Binary Methods	claim
93	137	An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches	claim
94	137	Automated Security Protocol Analysis With the AVISPA Tool	claim
95	137	Coinductive Field of Exact Real Numbers and General Corecursion	claim
96	136	Automated Game Analysis via Probabilistic Model Checking: a case study	claim
97	136	Priestley Duality for Strong Proximity Lattices	claim
98	136	Classically-controlled Quantum Computation	claim
99	136	Adaptive Application of SAT Solving Techniques	claim
100	136	A "Hardware Compiler" Semantics for Handel-C	claim
101	135	Formal Semantics and Analysis of Component Connectors in Reo	claim
102	135	Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge	claim
103	135	Coordination Models Based on a Formal Model of Distributed Object Reflection	claim
104	134	Partial Order Reduction for Probabilistic Branching Time	claim
105	134	Computing Over-Approximations with Bounded Model Checking	claim
106	134	Anonymity in Probabilistic and Nondeterministic Systems	claim
107	133	A Data Model for Data Integration	claim
108	133	Linking Semantic Models to Support CSP \|\| B Consistency Checking	claim
109	133	A Compositional Natural Semantics and Hoare Logic for Low-Level Languages	claim
110	132	A Domain-Specific Language for Generating Dataflow Analyzers	claim
111	131	Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names	claim
112	131	Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite	claim
113	131	The Case for Analog Circuit Verification	claim
114	131	Development Separation in Lambda-Calculus	claim
115	131	Automatic Parameterisation of Stochastic Petri Net Models of Biological Networks	claim
116	131	A Coalgebraic Representation of Reduction by Cone of Influence	claim
117	130	LSC Verification for UML Models with Unbounded Creation and Destruction	claim
118	130	Constraint-Based Concurrency and Beyond	claim
119	130	Modularity in Coalgebra	claim
120	129	The Algebra of Multi-Agent Dynamic Belief Revision	claim
121	129	From Coalition Logic to STIT	claim
122	129	A Constructive Object Oriented Modeling Language for Information Systems	claim
123	129	Confluence Thanks to Extensional Determinism	claim
124	128	Bunching for Regions and Locations	claim
125	128	Web Verification: Perspective and Challenges	claim
126	128	A Prolog Framework for the Rapid Prototyping of Language Processors with Attribute Grammars	claim
127	127	Open Bisimulation, Revisited	claim
128	127	Capability-Passing Processes	claim
129	127	A System Architecture for Context-Aware Service Discovery	claim
130	127	Process Algebraic Non-product-forms	claim
131	127	Tool support for MOLA	claim
132	127	Component Identification Through Program Slicing	claim
133	126	An Applicative Control-Flow Graph Based on Huet's Zipper	claim
134	126	A Congruence Format for Name-passing Calculi	claim
135	125	Estimating the Cost of Native Method Calls for Resource-bounded Functional Programming Languages	claim
136	125	Hoare vs Milner: Comparing Synchronizations in a Graphical Framework With Mobility	claim
137	125	Monads and Adjunctions for Global Exceptions	claim
138	125	On Timed Models and Full Abstraction	claim
139	125	ML Module Mania: A Type-Safe, Separately Compiled, Extensible Interpreter	claim
140	125	An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving	claim
141	125	Liveness Checking as Safety Checking for Infinite State Spaces	claim
142	125	Parallel Assignments in Software Model Checking	claim
143	125	Formalizing Type Operations Using the "Image" Type Constructor	claim
144	124	An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals	claim
145	124	A New Rabin-type Trapdoor Permutation Equivalent to Factoring	claim
146	124	Generic Trace Theory	claim
147	124	Formal Conformance Testing of Systems with Refused Inputs and Forbidden Actions	claim
148	123	Nonmonotonic Trust Management for P2P Applications	claim
149	123	Steering of Discrete Event Systems: Control Theory Approach	claim
150	123	From Discrete Duration Calculus to Symbolic Automata	claim
151	123	Foundations for Designing Secure Architectures	claim
152	123	Wrapping of Web Sources with restricted Query Interfaces by Query Tunneling	claim
153	122	Verification of Clock Synchronization Algorithms: Experiments on a Combination of Deductive Tools	claim
154	122	Abstract Effective Models	claim
155	122	Combining Aspect-Oriented and Strategic Programming	claim
156	122	Algorithmic Algebraic Model Checking III: Approximate Methods	claim
157	121	A Logic for Graphs with QoS	claim
158	121	A Hierarchy of SOS Rule Formats	claim
159	121	Topological Cones: Foundations for a Domain Theoretical Semantics Combining Probability and Nondeterminism	claim
160	120	Flexible Communication of Agents based on FIPA-ACL	claim
161	120	SCHOOL: a Small Chorded Object-Oriented Language	claim
162	120	Temporal Assertions using AspectJ	claim
163	120	Semantics of UML 2.0 Interactions with Variabilities	claim
164	120	Timers for Distributed Systems	claim
165	119	Cloning and Expanding Graph Transformation Rules for Refactoring	claim
166	119	Syntax-driven Behavior Partitioning for Model-checking of Esterel Programs	claim
167	119	Trace Machines for Observing Continuous-Time Markov Chains	claim
168	119	Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity	claim
169	118	An Operational Domain-theoretic Treatment of Recursive Types	claim
170	118	Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields	claim
171	118	A Toolkit for Generating and Displaying Proof Scores in the OTS/CafeOBJ Method	claim
172	118	The Language Evolver Lever - Tool Demonstration -	claim
173	118	Situations as Strings	claim
174	117	Reasoning About Imperative Quantum Programs	claim
175	117	Supporting Function Calls within PELCR	claim
176	117	Distributed Graph Traversals by Relabelling Systems with Applications	claim
177	117	A Formalization of Credit and Responsibility Within the GNDC Schema	claim
178	117	Interpreting SWRL Rules in RDF Graphs	claim
179	117	Probabilistic and Nondeterministic Aspects of Anonymity	claim
180	117	Monadic Second-Order Logic and Transitive Closure Logics over Trees	claim
181	116	Practical Datatype Specializations with Phantom Types and Recursion Schemes	claim
182	116	How Recent is a Web Document?	claim
183	116	Semantics of Visual Models in a Rule-based Setting	claim
184	116	Generic Pickling and Minimization	claim
185	116	Stepwise Refinement of Processes	claim
186	116	Reflections on a Geometry of Processes	claim
187	115	Using ATL for Checking Models	claim
188	115	Distributed Reactive XML	claim
189	115	Analyzing the Uses of a Software Modeling Tool	claim
190	114	Open-Source Model Checking	claim
191	114	Prototyping SOS Meta-theory in Maude	claim
192	114	Towards Efficient, Typed LR Parsers	claim
193	114	Run-Time Checking of Dynamic Properties	claim
194	114	What is algebraic in process theory?	claim
195	114	Stochastic Concurrent Constraint Programming	claim
196	114	Synthesis of Mealy Machines Using Derivatives	claim
197	113	The Role of Back-Pressure in Implementing Latency-Insensitive Systems	claim
198	113	A Large-Scale Experiment in Executing Extracted Programs	claim
199	113	Analytical Tableaux for da Costa's Hierarchy of Paraconsistent Logics	claim
200	113	Concurrent Java Test Generation as a Search Problem	claim
201	113	Mining Propositional Simplification Proofs for Small Validating Clauses	claim
202	112	Modeling Web Applications by the Multiple Levels of Integrity Policy	claim
203	112	Model Checking Linear Programs with Arrays	claim
204	112	A Petri-Net Based Reflective Framework for the Evolution of Dynamic Systems	claim
205	112	Interface Automata with Complex Actions	claim
206	112	Patterns for Timed Property Specifications	claim
207	112	Synchronous Dataflow Pattern Matching	claim
208	112	Distributed Symbolic Bounded Property Checking	claim
209	112	Mobile Agents in Interaction Spaces	claim
210	112	An Observational Model for Spatial Logics	claim
211	112	Towards SOS Meta-Theory for Language-Based Security	claim
212	111	A Verified Compiler for Synchronous Programs with Local Declarations	claim
213	111	Token-Passing Nets: Call-by-Need for Free	claim
214	111	What are the Fundamental Structures of Concurrency?: We still don't know!	claim
215	111	Retracing CSP	claim
216	111	Testing Self-Similar Networks	claim
217	110	First Steps in Synthetic Computability Theory	claim
218	110	The Linear Logical Abstract Machine	claim
219	110	Semantic Interoperability of Heterogeneous Semantic Resources	claim
220	109	Specifications via Realizability	claim
221	109	Roles as a Coordination Construct: Introducing powerJava	claim
222	109	Modeling the Exogenous Coordination of Mobile Channel-based Systems with Petri Nets	claim
223	109	A Logic for Application Level QoS	claim
224	109	An Overview of MANETs Simulation	claim
225	109	Incremental Verification for On-the-Fly Controller Synthesis	claim
226	108	Preventing Timing Leaks Through Transactional Branching Instructions	claim
227	108	On the Use of Singular Value Decomposition for a Fast Intrusion Detection System	claim
228	108	Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness	claim
229	107	Separation of Synchronous and Asynchronous Communication Via Testing	claim
230	107	Monitoring Interfaces for Faults	claim
231	107	Exact and Portable Profiling for the JVM Using Bytecode Instruction Counting	claim
232	106	Inductive Proof Outlines for Exceptions in Multithreaded Java	claim
233	106	Injective Convergence Spaces and Equilogical Spaces via Pretopological Spaces	claim
234	106	Probabilistic Observations and Valuations: (Extended Abstract)	claim
235	105	Feasible Reactivity for Synchronous Cooperative Threads	claim
236	105	A Game Semantics for Proof Search: Preliminary Results	claim
237	105	Integrating a SAT Solver with an LCF-style Theorem Prover	claim
238	105	Monte Carlo Methods for Process Algebra	claim
239	104	Using Bytecode Instruction Counting as Portable CPU Consumption Metric	claim
240	104	A Verification Approach for GALS Integration of Synchronous Components	claim
241	104	Paradigm as Organization-Oriented Coordination Language	claim
242	104	Synthesising Features by Games	claim
243	104	Abstract Graph Transformation	claim
244	103	Static Equivalence is Harder than Knowledge	claim
245	103	A WOWA-based Aggregation Technique on Trust Values Connected to Metadata	claim
246	103	Supporting SAT based BMC on Finite Path Models	claim
247	103	A Taxonomy of Model Transformation	claim
248	103	Incremental Confined Types Analysis	claim
249	102	Using Association Aspects to Implement Organisational Contracts	claim
250	102	Slicing XML Documents	claim
251	102	A Proof Theoretic Approach to Operational Semantics	claim
252	101	Mumbo: A Rule-Based Implementation of a Run-time Program Generation Language	claim
253	101	Towards "Dynamic Domains": Totally Continuous Cocomplete Q-categories	claim
254	100	Functors Determined by Values on Objects	claim
255	100	Adding Recursion to Dpi: (Extended Abstract)	claim
256	100	Quantitative Analysis With the Probabilistic Model Checker PRISM	claim
257	100	Towards a Logic for Performance and Mobility	claim
258	100	Typed Mobile Ambients in Maude	claim
259	99	Termination Criteria for Bounded Model Checking: Extensions and Comparison	claim
260	99	Metrics for Action-labelled Quantitative Transition Systems	claim
261	99	V for Virtual	claim
262	98	A Petri Net Semantics of a Simple Process Algebra for Mobility	claim
263	98	A Generic Process Algebra	claim
264	97	VyrdMC: Driving Runtime Refinement Checking with Model Checkers	claim
265	97	A Type-Safe Embedding of XDuce into ML	claim
266	96	Verification of AMBA Using a Combination of Model Checking and Theorem Proving	claim
267	96	Weighted Timed Automata: Model-Checking and Games	claim
268	96	Topological Analysis of Refinement	claim
269	96	Timed CSP: A Retrospective	claim
270	94	Reasoning About Partial Functions in the Formal Development of Programs	claim
271	94	Computation of Wave Fronts on a Disk I: Numerical Experiments	claim
272	94	Much Ado About Nothing?	claim
273	94	Reactive Concurrent Programming Revisited	claim
274	93	A Rule-based System for Web site Verification	claim
275	93	Transformations of Petri Nets	claim
276	92	Nonstandard Meromorphic Groups	claim
277	91	On Specifying Timeouts	claim
278	90	A Framework for Engineering Interactions in Java-based Component Systems	claim
279	90	Runtime Verification for High-Confidence Systems: A Monte Carlo Approach	claim
280	89	Soft Constraints for Security	claim
281	89	A Grainless Semantics for Parallel Programs with Shared Mutable Data	claim
282	89	A Type-theoretic Reconstruction of the Visitor Pattern	claim
283	89	The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems	claim
284	89	Towards a Quantitative Analysis of Security Protocols	claim
285	88	On Reversible Combinatory Logic	claim
286	80	Synchronisation in Trust Management Using Push Authorisation	claim
287	80	Return Value Prediction meets Information Theory	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers