Articles You Own
Replace
Withdraw
Cross list
Journal ref
|
Identifier |
Primary Category |
Title |
Actions |
Author |
1103.2812 |
cs.LO |
The GHZ/W-calculus contains rational arithmetic |
|
N |
1103.2811 |
cs.LO |
Three qubit entanglement within graphical Z/X-calculus |
|
N |
1103.2809 |
cs.CC |
On Computational Power of Quantum Read-Once Branching Programs |
|
N |
1103.2268 |
cs.CC |
Proceedings CSR 2010 Workshop on High Productivity Computations |
|
N |
1102.5586 |
cs.CR |
Covert channel detection using Information Theory |
|
N |
1102.5585 |
cs.CR |
On the Decidability of Non Interference over Unbounded Petri Nets |
|
N |
1102.5584 |
cs.LO |
A Spatial-Epistemic Logic for Reasoning about Security Protocols |
|
N |
1102.5161 |
cs.CR |
Proceedings 8th International Workshop on Security Issues in Concurrency |
|
N |
1102.4121 |
cs.LO |
Synchronizing Objectives for Markov Decision Processes |
|
N |
1102.4120 |
cs.GT |
Memory Reduction via Delayed Simulation |
|
N |
1102.4119 |
cs.LO |
A LTL Fragment for GR(1)-Synthesis |
|
N |
1102.4118 |
cs.LO |
Synthesizing Systems with Optimal Average-Case Behavior for Ratio Objectives |
|
N |
1102.4117 |
cs.LO |
Experimental Aspects of Synthesis |
|
N |
1102.3741 |
cs.GT |
Proceedings International Workshop on Interactions, Games and Protocols |
|
N |
1102.3734 |
cs.LO |
A standardisation proof for algebraic pattern calculi |
|
N |
1102.3733 |
cs.LO |
Uncurrying for Innermost Termination and Derivational Complexity |
|
N |
1102.3732 |
cs.LO |
Higher-order Rewriting for Executable Compiler Specifications |
|
N |
1102.3731 |
cs.LO |
On the Implementation of Dynamic Patterns |
|
N |
1102.3730 |
cs.LO |
Swapping: a natural bridge between named and indexed explicit substitution calculi |
|
N |
1102.3465 |
cs.LO |
Proceedings 5th International Workshop on Higher-Order Rewriting |
|
N |
1102.2656 |
cs.PL |
Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress) |
|
N |
1102.2655 |
cs.LO |
A new graphical calculus of proofs |
|
N |
1102.2654 |
cs.CE |
PORGY: Strategy-Driven Interactive Transformation of Graphs |
|
N |
1102.2653 |
cs.LO |
Dependently-Typed Formalisation of Typed Term Graphs |
|
N |
1102.2652 |
cs.GR |
Rule-based transformations for geometric modelling |
|
N |
1102.2651 |
cs.LO |
Term Graph Rewriting and Parallel Term Rewriting |
|
N |
1102.2268 |
cs.LO |
Proceedings 6th International Workshop on Computing with Terms and Graphs |
|
N |
1101.5446 |
cs.LO |
Dialectica Interpretation with Marked Counterexamples |
|
N |
1101.5445 |
cs.LO |
Relating Sequent Calculi for Bi-intuitionistic Propositional Logic |
|
N |
1101.5444 |
cs.LO |
An applicative theory for FPH |
|
N |
1101.5443 |
cs.LO |
Superdeduction in Lambda-Bar-Mu-Mu-Tilde |
|
N |
1101.5442 |
cs.LO |
On Various Negative Translations |
|
N |
1101.5441 |
cs.LO |
Interactive Learning Based Realizability and 1-Backtracking Games |
|
N |
1101.5200 |
cs.LO |
Proceedings Third International Workshop on Classical Logic and Computation |
|
N |
1101.4734 |
cs.LO |
A Few Considerations on Structural and Logical Composition in Specification Theories |
|
N |
1101.4733 |
cs.LO |
An Algebra of Synchronous Scheduling Interfaces |
|
N |
1101.4732 |
cs.PL |
Contracts for Abstract Processes in Service Composition |
|
N |
1101.4731 |
cs.SE |
Interface Theories for (A)synchronously Communicating Modal I/O-Transition Systems |
|
N |
1101.4430 |
cs.PL |
Equality, Quasi-Implicit Products, and Large Eliminations |
|
N |
1101.4429 |
cs.PL |
Session Types = Intersection Types + Union Types |
|
N |
1101.4428 |
cs.PL |
Untangling Typechecking of Intersections and Unions |
|
N |
1101.4426 |
cs.LO |
Intersection types for unbind and rebind |
|
N |
1101.4425 |
cs.LO |
Sound and Complete Typing for lambda-mu |
|
N |
1101.4424 |
cs.LO |
Intersection Logic in sequent calculus style |
|
N |
1101.4423 |
cs.LO |
Relating Church-Style and Curry-Style Subtyping |
|
N |
1101.4266 |
cs.LO |
Proceedings Foundations for Interface Technologies |
|
N |
1101.4104 |
cs.LO |
Proceedings Fifth Workshop on Intersection Types and Related Systems |
|
N |
1012.5563 |
cs.LO |
Loops under Strategies ... Continued |
|
N |
1012.5562 |
cs.LO |
Termination of Rewriting with and Automated Synthesis of Forbidden Patterns |
|
N |
1012.5561 |
cs.CY |
Properties of Exercise Strategies |
|
N |
1012.5560 |
cs.PL |
Strategic programming on graph rewriting systems |
|
N |
1012.5337 |
cs.LO |
Proceedings International Workshop on Strategies in Rewriting, Proving, and Programming |
|
N |
1012.4900 |
cs.PL |
Termination Casts: A Flexible Approach to Termination with General Recursion |
|
N |
1012.4899 |
cs.LO |
General Recursion and Formal Topology |
|
N |
1012.4898 |
cs.LO |
Beating the Productivity Checker Using Embedded Languages |
|
N |
1012.4897 |
cs.LO |
Rewriting and Well-Definedness within a Proof System |
|
N |
1012.4896 |
cs.PL |
MiniAgda: Integrating Sized and Dependent Types |
|
N |
1012.4895 |
cs.LO |
Recursive Definitions of Monadic Functions |
|
N |
1012.4894 |
cs.SC |
On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity |
|
N |
1012.4893 |
cs.PL |
Towards Correctness of Program Transformations Through Unification and Critical Pair Computation |
|
N |
1012.4892 |
cs.LO |
A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints |
|
N |
1012.4891 |
cs.SC |
Unification modulo a partial theory of exponentiation |
|
N |
1012.4890 |
cs.LO |
Nominal Unification Revisited |
|
N |
1012.4555 |
cs.LO |
Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers |
|
N |
1012.4554 |
cs.LO |
Proceedings 24th International Workshop on Unification |
|
N |
1011.6438 |
cs.LO |
Process Behaviour: Formulae vs. Tests (Extended Abstract) |
|
N |
1011.6437 |
cs.LO |
Breaking Symmetries |
|
N |
1011.6436 |
cs.DC |
Multiparty Symmetric Sum Types |
|
N |
1011.6435 |
cs.LO |
Robustness of Equations Under Operational Extensions |
|
N |
1011.6434 |
cs.LO |
Models for CSP with availability information |
|
N |
1011.6433 |
cs.LO |
A Process Calculus for Expressing Finite Place/Transition Petri Nets |
|
N |
1011.6432 |
cs.FL |
Relating timed and register automata |
|
N |
1011.6431 |
cs.LO |
Light Logics and Higher-Order Processes |
|
N |
1011.6430 |
cs.LO |
A criterion for separating process calculi |
|
N |
1011.6429 |
cs.LO |
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract) |
|
N |
1011.6012 |
cs.LO |
Proceedings 17th International Workshop on Expressiveness in Concurrency |
|
N |
1011.0498 |
cs.CE |
Qualitative modelling and analysis of regulations in multi-cellular systems using Petri nets and topological collections |
|
N |
1011.0496 |
cs.CE |
Lumpability Abstractions of Rule-based Systems |
|
N |
1011.0495 |
cs.DC |
Edge- and Node-Disjoint Paths in P Systems |
|
N |
1011.0494 |
cs.PL |
Hybrid Calculus of Wrapped Compartments |
|
N |
1011.0493 |
cs.CE |
Modeling biological systems with delays in Bio-PEPA |
|
N |
1011.0492 |
cs.CE |
Multiscale Bone Remodelling with Spatial P Systems |
|
N |
1011.0491 |
cs.LO |
Aspects of multiscale modelling in a process algebra for biological systems |
|
N |
1011.0490 |
cs.CE |
Computational Modeling for the Activation Cycle of G-proteins by G-protein-coupled Receptors |
|
N |
1011.0489 |
cs.CE |
An Abstraction Theory for Qualitative Models of Biological Systems |
|
N |
1011.0488 |
cs.CE |
Measurable Stochastics for Brane Calculus |
|
N |
1011.0487 |
cs.PL |
Stochastic Simulation of Process Calculi for Biology |
|
N |
1011.0223 |
cs.FL |
IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata |
|
N |
1011.0222 |
cs.FL |
Probabilistic regular graphs |
|
N |
1011.0221 |
cs.FL |
Implicit Real Vector Automata |
|
N |
1011.0220 |
cs.FL |
A Decidable Characterization of a Graphical Pi-calculus with Iterators |
|
N |
1011.0219 |
cs.FL |
On Zone-Based Analysis of Duration Probabilistic Automata |
|
N |
1011.0218 |
cs.FL |
On interleaving in {P,A}-Time Petri nets with strong semantics |
|
N |
1011.0217 |
cs.FL |
On Selective Unboundedness of VASS |
|
N |
1011.0051 |
cs.LO |
Proceedings Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi 2010 |
|
N |
1010.6112 |
cs.FL |
Proceedings 12th International Workshop on Verification of Infinite-State Systems |
|
N |
1010.5573 |
cs.DC |
A linear programming approach to general dataflow process network verification and dimensioning |
|
N |
1010.5572 |
cs.LO |
A theory of desynchronisable closed loop system |
|
N |
1010.5571 |
cs.LO |
An Introduction to Time-Constrained Automata |
|
N |
1010.5570 |
cs.PL |
Primitives for Contract-based Synchronization |
|
N |
1010.5569 |
cs.PL |
Static vs Dynamic SAGAs |
|
N |
1010.5568 |
cs.CR |
Safer in the Clouds (Extended Abstract) |
|
N |
1010.5567 |
cs.CR |
History-sensitive versus future-sensitive approaches to security in distributed systems |
|
N |
1010.5566 |
cs.PL |
A Graphical Approach to Progress for Structured Communication in Web Services |
|
N |
1010.5565 |
cs.LO |
Port Protocols for Deadlock-Freedom of Component Systems |
|
N |
1010.5308 |
cs.LO |
Proceedings Third Interaction and Concurrency Experience: Guaranteed Interaction |
|
N |
1010.2828 |
cs.DC |
A Reusable Component for Communication and Data Synchronization in Mobile Distributed Interactive Applications |
|
N |
1010.2827 |
cs.SE |
Multilevel Contracts for Trusted Components |
|
N |
1010.2826 |
cs.SE |
Tau Be or not Tau Be? - A Perspective on Service Compatibility and Substitutability |
|
N |
1010.2825 |
cs.SE |
Components Interoperability through Mediating Connector Patterns |
|
N |
1010.2824 |
cs.DC |
Behavioural Models for Group Communications |
|
N |
1010.2823 |
cs.SE |
Partition Refinement of Component Interaction Automata: Why Structure Matters More Than Size |
|
N |
1010.2822 |
cs.SE |
Contract Aware Components, 10 years after |
|
N |
1010.2337 |
cs.SE |
Proceedings International Workshop on Component and Service Interoperability |
|
N |
1009.4601 |
cs.LO |
Using the PALS Architecture to Verify a Distributed Topology Control Protocol for Wireless Multi-Hop Networks in the Presence of Node Failures |
|
N |
1009.4266 |
cs.LO |
Distributed Real-Time Emulation of Formally-Defined Patterns for Safe Medical Device Control |
|
N |
1009.4265 |
cs.LO |
Specification and Verification of Distributed Embedded Systems: A Traffic Intersection Product Family |
|
N |
1009.4264 |
cs.LO |
Model Checking Classes of Metric LTL Properties of Object-Oriented Real-Time Maude Specifications |
|
N |
1009.4263 |
cs.LO |
A Rewriting-Logic-Based Technique for Modeling Thermal Systems |
|
N |
1009.4262 |
cs.PL |
Lightweight Time Modeling in Timed Creol |
|
N |
1009.4261 |
cs.LO |
Extending the Real-Time Maude Semantics of Ptolemy to Hierarchical DE Models |
|
N |
1009.4260 |
cs.LO |
Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis |
|
N |
1009.4259 |
cs.SE |
Modeling and Analyzing Adaptive User-Centric Systems in Real-Time Maude |
|
N |
1009.3982 |
cs.LO |
Proceedings First International Workshop on Rewriting Techniques for Real-Time Systems |
|
N |
1009.3716 |
cs.SE |
Analysis and Verification of Service Interaction Protocols - A Brief Survey |
|
N |
1009.3715 |
cs.SE |
Contracting the Facebook API |
|
N |
1009.3714 |
cs.SE |
Browser-based Analysis of Web Framework Applications |
|
N |
1009.3713 |
cs.SE |
Relational Constraint Driven Test Case Synthesis for Web Applications |
|
N |
1009.3712 |
cs.SE |
Preventing SQL Injection through Automatic Query Sanitization with ASSIST |
|
N |
1009.3711 |
cs.SE |
Structural Learning of Attack Vectors for Generating Mutated XSS Attacks |
|
N |
1009.3710 |
cs.SE |
Optimizing Computation of Recovery Plans for BPEL Applications |
|
N |
1009.3306 |
cs.SE |
Proceedings Fourth International Workshop on Testing, Analysis and Verification of Web Software |
|
N |
1009.2795 |
cs.LO |
Pattern Unification for the Lambda Calculus with Linear and Affine Types |
|
N |
1009.2794 |
cs.LO |
Representing Isabelle in LF |
|
N |
1009.2793 |
cs.PL |
A Monadic Formalization of ML5 |
|
N |
1009.2792 |
cs.LO |
Pure Type Systems without Explicit Contexts |
|
N |
1009.2791 |
cs.LO |
Closed nominal rewriting and efficiently computable nominal algebra equality |
|
N |
1009.2790 |
cs.LO |
Generating Bijections between HOAS and the Natural Numbers |
|
N |
1009.2789 |
cs.LO |
Explicit Substitutions for Contextual Type Theory |
|
N |
1009.2189 |
cs.LO |
Proceedings 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice |
|
N |
1008.3306 |
cs.MA |
Modelling of Multi-Agent Systems: Experiences with Membrane Computing and Future Challenges |
|
N |
1008.3305 |
cs.DS |
Celer: an Efficient Program for Genotype Elimination |
|
N |
1008.3304 |
cs.CE |
An Analysis on the Influence of Network Topologies on Local and Global Dynamics of Metapopulation Systems |
|
N |
1008.3303 |
cs.FL |
An Individual-based Probabilistic Model for Fish Stock Simulation |
|
N |
1008.3301 |
cs.CE |
Modelling the Dynamics of an Aedes albopictus Population |
|
N |
1008.3147 |
cs.CE |
Proceedings First Workshop on Applications of Membrane computing, Concurrency and Agent-based modelling in POPulation biology |
|
N |
1008.2112 |
cs.LO |
Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction |
|
N |
1008.2111 |
cs.LO |
Structural Decomposition of Reactions of Graph-Like Objects |
|
N |
1008.2110 |
cs.LO |
Hierarchical states in the Compositional Interchange Format |
|
N |
1008.2109 |
cs.LO |
Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics |
|
N |
1008.2108 |
cs.LO |
Equational Characterization of Covariant-Contravariant Simulation and Conformance Simulation Semantics |
|
N |
1008.1906 |
cs.LO |
Proceedings Seventh Workshop on Structural Operational Semantics |
|
N |
1008.1668 |
cs.FL |
State Complexity of Testing Divisibility |
|
N |
1008.1667 |
cs.FL |
Finite-State Complexity and the Size of Transducers |
|
N |
1008.1666 |
cs.CC |
On the Complexity of the Evaluation of Transient Extensions of Boolean Functions |
|
N |
1008.1665 |
cs.FL |
Remembering Chandra Kintala |
|
N |
1008.1664 |
cs.GR |
L-systems in Geometric Modeling |
|
N |
1008.1663 |
cs.FL |
Learning Residual Finite-State Automata Using Observation Tables |
|
N |
1008.1662 |
cs.FL |
Complexity in Prefix-Free Regular Languages |
|
N |
1008.1661 |
cs.FL |
Nondeterministic State Complexity for Suffix-Free Regular Languages |
|
N |
1008.1660 |
cs.FL |
On the Descriptional Complexity of Limited Propagating Lindenmayer Systems |
|
N |
1008.1659 |
cs.FL |
The Maximal Subword Complexity of Quasiperiodic Infinite Words |
|
N |
1008.1658 |
cs.FL |
Transformations Between Different Types of Unranked Bottom-Up Tree Automata |
|
N |
1008.1657 |
cs.FL |
Operational State Complexity of Deterministic Unranked Tree Automata |
|
N |
1008.1656 |
cs.FL |
State Elimination Ordering Strategies: Some Experimental Results |
|
N |
1008.1655 |
cs.FL |
Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties |
|
N |
1008.1654 |
cs.FL |
Ciliate Gene Unscrambling with Fewer Templates |
|
N |
1008.1653 |
cs.FL |
The Magic Number Problem for Subregular Language Families |
|
N |
1008.1652 |
cs.FL |
Transition Complexity of Incomplete DFAs |
|
N |
1008.1651 |
cs.FL |
Graph-Controlled Insertion-Deletion Systems |
|
N |
1008.1650 |
cs.FL |
Representing Small Ordinals by Finite Automata |
|
N |
1008.1649 |
cs.CC |
Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication |
|
N |
1008.1648 |
cs.FL |
State Complexity of Catenation Combined with Star and Reversal |
|
N |
1008.1270 |
cs.FL |
Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems |
|
N |
1007.5095 |
cs.LO |
Timed Automata Semantics for Analyzing Creol |
|
N |
1007.5094 |
cs.SE |
A Compositional Semantics for Stochastic Reo Connectors |
|
N |
1007.5093 |
cs.SE |
On Coordinating Collaborative Objects |
|
N |
1007.5092 |
cs.SE |
Handling Data-Based Concurrency in Context-Aware Service Protocols |
|
N |
1007.5091 |
cs.DC |
Self-Recovering Sensor-Actor Networks |
|
N |
1007.5090 |
cs.DC |
Implementing Distributed Controllers for Systems with Priorities |
|
N |
1007.5089 |
cs.PL |
CREOLE: a Universal Language for Creating, Requesting, Updating and Deleting Resources |
|
N |
1007.5088 |
cs.DC |
Simplified Distributed Programming with Micro Objects |
|
N |
1007.4993 |
cs.SE |
Proceedings Ninth International Workshop on the Foundations of Coordination Languages and Software Architectures |
|
N |
1007.3794 |
cs.LO |
Open Graphs and Computational Reasoning |
|
N |
1007.1024 |
cs.AI |
Model Counting in Product Configuration |
|
N |
1007.1023 |
cs.SE |
CONFIGEN: A tool for managing configuration options |
|
N |
1007.1022 |
cs.SE |
Comparison of PBO solvers in a dependency solving domain |
|
N |
1007.1021 |
cs.LO |
Solving Linux Upgradeability Problems Using Boolean Optimization |
|
N |
1007.1020 |
cs.LO |
Handling software upgradeability problems with MILP solvers |
|
N |
1007.0831 |
cs.LO |
Proceedings First International Workshop on Logics for Component Configuration |
|
N |
1006.5107 |
cs.PL |
Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages |
|
N |
1006.5104 |
cs.PF |
A new tool for the performance analysis of massively parallel computer systems |
|
N |
1006.5103 |
cs.FL |
Optimal Time-Abstract Schedulers for CTMDPs and Markov Games |
|
N |
1006.5102 |
cs.LO |
An expectation transformer approach to predicate abstraction and data independence for probabilistic programs |
|
N |
1006.5101 |
cs.LO |
Probabilistic Model-Based Safety Analysis |
|
N |
1006.5100 |
cs.LO |
Testing Reactive Probabilistic Processes |
|
N |
1006.5099 |
cs.CE |
Stochastic Calculus of Wrapped Compartments |
|
N |
1006.5098 |
cs.LO |
Injecting Abstract Interpretations into Linear Cost Models |
|
N |
1006.5097 |
cs.GT |
Quantitative Fairness Games |
|
N |
1006.5096 |
cs.LO |
Automatic Probabilistic Program Verification through Random Variable Abstraction |
|
N |
1006.5095 |
cs.PF |
Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata |
|
N |
1006.5094 |
cs.LO |
Approximate Testing Equivalence Based on Time, Probability, and Observed Behavior |
|
N |
1006.2993 |
cs.LO |
Two-Domain DNA Strand Displacement |
|
N |
1006.2992 |
cs.GT |
Imitation in Large Games |
|
N |
1006.1937 |
quant-ph |
Proceedings Sixth Workshop on Developments in Computational Models: Causality, Computation, and Physics |
|
N |
1006.1711 |
cs.GT |
Proceedings First Symposium on Games, Automata, Logic, and Formal Verification |
|
N |
1006.1689 |
cs.DC |
Proceedings First International Workshop on Decentralized Coordination of Distributed Processes |
|
N |
1006.1681 |
cs.AI |
Towards the Design of Heuristics by Means of Self-Assembly |
|
N |
1006.1450 |
cs.MA |
Separating Agent-Functioning and Inter-Agent Coordination by Activated Modules: The DECOMAS Architecture |
|
N |
1006.1449 |
cs.CR |
On Secure Workflow Decentralisation on the Internet |
|
N |
1006.1434 |
cs.NE |
Computing by Means of Physics-Based Optical Neural Networks |
|
N |
1006.1433 |
cs.LO |
Semantics of a Typed Algebraic Lambda-Calculus |
|
N |
1006.1432 |
cs.LO |
The space of measurement outcomes as a spectrum for non-commutative algebras |
|
N |
1006.1431 |
cs.DS |
Algebraic characterisation of one-way patterns |
|
N |
1006.1430 |
cs.LO |
Equilibrium and Termination |
|
N |
1006.1429 |
cs.LO |
Causality and the Semantics of Provenance |
|
N |
1006.1428 |
cs.FL |
Turing Automata and Graph Machines |
|
N |
1006.1426 |
quant-ph |
Classification of delocalization power of global unitary operations in terms of LOCC one-piece relocalization |
|
N |
1006.1424 |
quant-ph |
Measurement Based Quantum Computation on Fractal Lattices |
|
N |
1006.1423 |
quant-ph |
Quantum algorithms for testing Boolean functions |
|
N |
1006.1422 |
quant-ph |
Engineering Long Range Distance Independent Entanglement through Kondo Impurities in Spin Chains |
|
N |
1006.1420 |
quant-ph |
Landauer's principle in the quantum domain |
|
N |
1006.1419 |
quant-ph |
Understanding the Quantum Computational Speed-up via De-quantisation |
|
N |
1006.1416 |
cs.LO |
Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking |
|
N |
1006.1415 |
cs.GT |
Formats of Winning Strategies for Six Types of Pushdown Games |
|
N |
1006.1414 |
cs.LO |
Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions |
|
N |
1006.1413 |
cs.PL |
Coinductive subtyping for abstract compilation of object-oriented languages into Horn formulas |
|
N |
1006.1412 |
cs.LO |
On the Expressiveness of Markovian Process Calculi with Durational and Durationless Actions |
|
N |
1006.1411 |
quant-ph |
Unitary Noise and the Mermin-GHZ Game |
|
N |
1006.1410 |
cs.GT |
Playing Muller Games in a Hurry |
|
N |
1006.1409 |
cs.GT |
Local Strategy Improvement for Parity Game Solving |
|
N |
1006.1408 |
cs.LO |
Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis |
|
N |
1006.1407 |
cs.LO |
Begin, After, and Later: a Maximal Decidable Interval Temporal Logic |
|
N |
1006.1406 |
cs.LO |
On Modal {\mu}-Calculus over Finite Graphs with Bounded Strongly Connected Components |
|
N |
1006.1405 |
cs.GT |
Using Strategy Improvement to Stay Alive |
|
N |
1006.1404 |
cs.GT |
How do we remember the past in randomised strategies? |
|
N |
1006.1403 |
cs.LO |
Discounting in Games across Time Scales |
|
N |
1006.1402 |
cs.GT |
Blackwell-Optimal Strategies in Priority Mean-Payoff Games |
|
N |
1006.0551 |
cs.CC |
Proceedings Seventh International Conference on Computability and Complexity in Analysis |
|
N |
1006.0406 |
cs.CC |
Complete Multi-Representations of Sets in a Computable Measure Space |
|
N |
1006.0405 |
cs.NA |
A Rigorous Extension of the Sch\"onhage-Strassen Integer Multiplication Algorithm Using Complex Interval Arithmetic |
|
N |
1006.0404 |
cs.MS |
Computational Complexity of Iterated Maps on the Interval (Extended Abstract) |
|
N |
1006.0403 |
cs.LO |
NP-Logic Systems and Model-Equivalence Reductions |
|
N |
1006.0402 |
cs.CC |
A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract) |
|
N |
1006.0401 |
cs.MS |
Making big steps in trajectories |
|
N |
1006.0400 |
cs.CC |
Computing the Solutions of the Combined Korteweg-de Vries Equation by Turing Machines |
|
N |
1006.0399 |
cs.CC |
The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function (Extended Abstract) |
|
N |
1006.0398 |
cs.LO |
Real Analytic Machines and Degrees |
|
N |
1006.0397 |
cs.LO |
Effective Capacity and Randomness of Closed Sets |
|
N |
1006.0396 |
cs.LO |
The Cardinality of an Oracle in Blum-Shub-Smale Computation |
|
N |
1006.0395 |
cs.LO |
Computation with Advice |
|
N |
1006.0394 |
cs.CC |
On the Weak Computability of Continuous Real Functions |
|
N |
1006.0393 |
cs.LO |
A domain-theoretic investigation of posets of sub-sigma-algebras (extended abstract) |
|
N |
1006.0392 |
cs.NA |
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems |
|
N |
1005.0653 |
cs.LO |
Proceedings International Workshop on Developments in Implicit Computational complExity |
|
N |
1005.0524 |
cs.LO |
Church => Scott = Ptime: an application of resource sensitive realizability |
|
N |
1005.0522 |
cs.LO |
Safe Recursion on Notation into a Light Logic by Levels |
|
N |
1005.0521 |
cs.LO |
General Ramified Recurrence is Sound for Polynomial Time |
|
N |
1005.0519 |
cs.CC |
Observation of implicit complexity by non confluence |
|
N |
1005.0518 |
cs.LO |
On Decidable Growth-Rate Properties of Imperative Programs |
|
N |
1003.5758 |
cs.PL |
Proceedings Tenth International Workshop on Rule-Based Programming |
|
N |
1003.5716 |
cs.LO |
Proceedings First International Workshop on Linearity |
|
N |
1003.5518 |
cs.LO |
On Linear Information Systems |
|
N |
1003.5515 |
cs.LO |
Labelled Lambda-calculi with Explicit Copy and Erase |
|
N |
1003.5513 |
cs.LO |
Uniqueness Typing for Resource Management in Message-Passing Concurrency |
|
N |
1003.5512 |
cs.LO |
Resource-Bound Quantification for Graph Transformation |
|
N |
1003.5511 |
cs.LO |
Categorical Models for a Semantically Linear Lambda-calculus |
|
N |
1003.5363 |
cs.LO |
Proceedings FM-09 Workshop on Formal Methods for Aerospace |
|
N |
1003.5350 |
cs.DB |
An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications |
|
N |
1003.4812 |
cs.LO |
Bisimulation Relations Between Automata, Stochastic Differential Equations and Petri Nets |
|
N |
1003.4803 |
cs.LO |
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems |
|
N |
1003.4802 |
cs.LO |
Automatic Generation of Proof Tactics for Finite-Valued Logics |
|
N |
1003.4800 |
cs.LO |
Object-oriented Programming Laws for Annotated Java Programs |
|
N |
1003.4799 |
cs.LO |
A Type System for Tom |
|
N |
1003.4563 |
cs.LO |
The Semantics of Graph Programs |
|
N |
1003.4562 |
cs.LO |
An Implementation of Nested Pattern Matching in Interaction Nets |
|
N |
1003.4326 |
cs.LO |
Graph Creation, Visualisation and Transformation |
|
N |
1003.4090 |
cs.LO |
Modeling and Reasoning over Distributed Systems using Aspect-Oriented Graph Grammars |
|
N |
1003.2871 |
cs.PL |
Implementing Multi-Periodic Critical Systems: from Design to Code Generation |
|
N |
1003.1741 |
cs.SE |
Formalization and Validation of Safety-Critical Requirements |
|
N |
1003.1682 |
cs.SE |
An Entry Point for Formal Methods: Specification and Analysis of Event Logs |
|
N |
1003.0634 |
cs.OH |
Flexible Lyapunov Functions and Applications to Fast Mechatronic Systems |
|
N |
1003.0617 |
cs.MA |
Agent Based Approaches to Engineering Autonomous Space Software |
|
N |
1003.0554 |
cs.PL |
Polychronous Interpretation of Synoptic, a Domain Specific Modeling Language for Embedded Flight-Software |
|
N |
1003.0431 |
cs.LO |
Re-verification of a Lip Synchronization Protocol using Robust Reachability |
|
N |
1003.0396 |
cs.SE |
Developing Experimental Models for NASA Missions with ASSL |
|
N |
1003.0381 |
cs.LO |
Modelling and Verification of Multiple UAV Mission Using SMV |
|
N |
1002.4919 |
cs.CE |
Proceedings Third Workshop From Biology To Concurrency and back |
|
N |
1002.4661 |
cs.CE |
Complementary approaches to understanding the plant circadian clock |
|
N |
1002.4067 |
cs.CE |
A Taxonomy of Causality-Based Biological Properties |
|
N |
1002.4066 |
cs.CE |
Types for BioAmbients |
|
N |
1002.4065 |
cs.CE |
BlenX-based compositional modeling of complex reaction mechanisms |
|
N |
1002.4064 |
cs.CE |
A flexible architecture for modeling and simulation of diffusional association |
|
N |
1002.4063 |
cs.CE |
Investigating modularity in the analysis of process algebra models of biochemical systems |
|
N |
1002.4062 |
cs.CE |
Modelling and Analysis of Biochemical Signalling Pathway Cross-talk |
|
N |
1002.4061 |
cs.CE |
Flux Analysis in Process Models via Causality |
|
N |
1002.2978 |
cs.LO |
Proceedings Sixth Workshop on Structural Operational Semantics |
|
N |
1002.2873 |
cs.LO |
Analysis of Boolean Equation Systems through Structure Graphs |
|
N |
1002.2872 |
cs.PL |
Rewriting Logic Semantics of a Plan Execution Language |
|
N |
1002.2871 |
cs.LO |
Reverse Bisimulations on Stable Configuration Structures |
|
N |
1002.2869 |
cs.LO |
On Barbs and Labels in Reactive Systems |
|
N |
1002.2868 |
cs.LO |
Causality in the Semantics of Esterel: Revisited |
|
N |
1002.2867 |
cs.LO |
A Fully Abstract Symbolic Semantics for Psi-Calculi |
|
N |
1002.2864 |
cs.LO |
A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages |
|
N |
1002.1408 |
cs.PL |
Proceedings Second International Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software |
|
N |
1002.0942 |
cs.PL |
Type Inference for Deadlock Detection in a Multithreaded Polymorphic Typed Assembly Language |
|
N |
1002.0940 |
cs.PL |
A Concurrent Language with a Uniform Treatment of Regions and Locks |
|
N |
1002.0939 |
cs.DC |
Virtual Machine Support for Many-Core Architectures: Decoupling Abstract from Concrete Concurrency Models |
|
N |
1002.0937 |
cs.PL |
Towards the Safe Programming of Wireless Sensor Networks |
|
N |
1002.0936 |
cs.PL |
Programming Idioms for Transactional Events |
|
N |
1002.0935 |
cs.LO |
Execution Models for Choreographies and Cryptoprotocols |
|
N |
1002.0933 |
cs.PL |
Session-Based Programming for Parallel Algorithms: Expressiveness and Performance |
|
N |
1002.0930 |
cs.PL |
Towards a Unified Framework for Declarative Structured Communications |
|
N |
1001.5310 |
cs.SE |
Proceedings Second Workshop on Formal Aspects of Virtual Organisations |
|
N |
1001.5050 |
cs.SE |
Formal Modelling of a Usable Identity Management Solution for Virtual Organisations |
|
N |
1001.4573 |
cs.PL |
Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming |
|
N |
1001.4381 |
cs.LO |
Stream Productivity by Outermost Termination |
|
N |
1001.4438 |
cs.LO |
Principal Typings in a Restricted Intersection Type System for Beta Normal Forms with De Bruijn Indices |
|
N |
1001.4437 |
cs.LO |
Extending Context-Sensitivity in Term Rewriting |
|
N |
1001.4436 |
cs.SE |
Specification of Products and Product Lines |
|
N |
1001.4434 |
cs.PL |
Strategies in PRholog |
|
N |
1001.4429 |
cs.LO |
Superdevelopments for Weak Reduction |
|
N |
1001.4427 |
cs.GT |
Extensional and Intensional Strategies |
|
N |
1001.4419 |
cs.MA |
A Framework to Manage the Complex Organisation of Collaborating: Its Application to Autonomous Systems |
|
N |
1001.4413 |
cs.SE |
Structure and Behaviour of Virtual Organisation Breeding Environments |
|
N |
1001.4411 |
cs.CR |
Common Representation of Information Flows for Dynamic Coalitions |
|
N |
1001.4405 |
cs.LO |
A Formal Framework of Virtual Organisations as Agent Societies |
|
N |
0912.3036 |
cs.LO |
Proceedings 8th International Workshop on Parallel and Distributed Methods in verifiCation |
|
N |
0912.2785 |
cs.LO |
Parallel symbolic state-space exploration is difficult, but what is the alternative? |
|
N |
0912.2555 |
cs.DC |
DiVinE-CUDA - A Tool for GPU Accelerated LTL Model Checking |
|
N |
0912.2554 |
cs.DC |
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs |
|
N |
0912.2553 |
cs.LO |
An Efficient Explicit-time Description Method for Timed Model Checking |
|
N |
0912.2552 |
cs.LO |
Tarmo: A Framework for Parallelized Bounded Model Checking |
|
N |
0912.2551 |
cs.CE |
Efficient Parallel Statistical Model Checking of Biochemical Networks |
|
N |
0912.2550 |
cs.LO |
Distributed Branching Bisimulation Minimization by Inductive Signatures |
|
N |
0912.2549 |
cs.DC |
Formal Aspects of Grid Brokering |
|
N |
0912.2128 |
cs.LO |
Proceedings First Workshop on Quantitative Formal Methods: Theory and Applications |
|
N |
0912.1903 |
cs.LO |
Verifying Real-Time Systems using Explicit-time Description Methods |
|
N |
0912.1902 |
cs.LO |
Strong, Weak and Branching Bisimulation for Transition Systems and Markov Reward Chains: A Unifying Matrix Approach |
|
N |
0912.1901 |
cs.LO |
Modelling Clock Synchronization in the Chess gMAC WSN Protocol |
|
N |
0912.1900 |
cs.LO |
Quantitative Safety: Linking Proof-Based Verification with Model Checking for Probabilistic Systems |
|
N |
0912.1899 |
cs.LO |
Markovian Testing Equivalence and Exponentially Timed Internal Actions |
|
N |
0912.1897 |
cs.FL |
Adaptive Scheduling of Data Paths using Uppaal Tiga |
|
N |
0912.0759 |
cs.LO |
Proceedings 2nd Interaction and Concurrency Experience: Structured Interactions |
|
N |
0912.0555 |
cs.LO |
A non-interleaving process calculus for multi-party synchronisation |
|
N |
0912.0034 |
cs.CE |
Proceedings Third Workshop on Membrane Computing and Biologically Inspired Process Calculi 2009 |
|
N |
0911.5525 |
cs.LO |
Towards an embedding of Graph Transformation in Intuitionistic Linear Logic |
|
N |
0911.5449 |
cs.PL |
Session Types at the Mirror |
|
N |
0911.5447 |
cs.LO |
Integrated Structure and Semantics for Reo Connectors and Petri Nets |
|
N |
0911.5446 |
cs.SE |
Symbolic Implementation of Connectors in BIP |
|
N |
0911.5445 |
cs.LO |
Coordination via Interaction Constraints I: Local Logic |
|
N |
0911.5444 |
cs.CR |
Choreographies with Secure Boxes and Compromised Principals |
|
N |
0911.4989 |
cs.CE |
Dependencies and Simultaneity in Membrane Systems |
|
N |
0911.4988 |
cs.LO |
Abstract Interpretation for Probabilistic Termination of Biological Systems |
|
N |
0911.4987 |
cs.CE |
Drip and Mate Operations Acting in Test Tube Systems and Tissue-like P systems |
|
N |
0911.4986 |
cs.CE |
New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems |
|
N |
0911.4985 |
cs.FL |
A Type System for a Stochastic CLS |
|
N |
0911.4984 |
cs.CE |
A compartmental model of the cAMP/PKA/MAPK pathway in Bio-PEPA |
|
N |
0911.4983 |
cs.CE |
Modelling Cell Cycle using Different Levels of Representation |
|
N |
0911.4854 |
cs.CE |
A Process Calculus for Molecular Interaction Maps |
|
N |
0911.4513 |
cs.CE |
A framework for protein and membrane interactions |
|
N |
0911.4510 |
cs.CE |
Bigraphical models for protein and membrane interactions |
|
N |
0911.3440 |
cs.LO |
Proceedings International Workshop on Verification of Infinite-State Systems |
|
N |
0911.3405 |
cs.LO |
Dense-choice Counter Machines revisited |
|
N |
0911.3283 |
cs.FL |
On external presentations of infinite graphs |
|
N |
0911.3277 |
cs.LO |
Automated Predicate Abstraction for Real-Time Models |
|
N |
0911.3276 |
cs.DM |
An Inverse Method for Policy-Iteration Based Algorithms |
|
N |
0911.3275 |
cs.FL |
A Tighter Bound for the Determinization of Visibly Pushdown Automata |
|
N |
0911.3189 |
cs.LO |
Proceedings 16th International Workshop on Expressiveness in Concurrency |
|
N |
0911.2829 |
cs.CE |
Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature |
|
N |
0911.2760 |
cs.LO |
Robustness of a bisimulation-type faster-than preorder |
|
N |
0911.2508 |
cs.OH |
Rule-based Modelling and Tunable Resolution |
|
N |
0911.2390 |
cs.AI |
How Creative Should Creators Be To Optimize the Evolution of Ideas? A Computational Model |
|
N |
0911.2330 |
cs.CE |
Diffusion Controlled Reactions, Fluctuation Dominated Kinetics, and Living Cell Biochemistry |
|
N |
0911.2327 |
cs.PL |
An Intuitive Automated Modelling Interface for Systems Biology |
|
N |
0911.2325 |
cs.CC |
Characterizing Polynomial Time Computability of Rational and Real Functions |
|
N |
0911.2324 |
cs.NE |
Deterministic Autopoietic Automata |
|
N |
0911.2323 |
cs.LO |
A Type System for Required/Excluded Elements in CLS |
|
N |
0911.2322 |
cs.DM |
Random Constraint Satisfaction Problems |
|
N |
0911.2320 |
cs.FL |
Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages |
|
N |
0911.2319 |
cs.LO |
Orthomodular Lattices Induced by the Concurrency Relation |
|
N |
0911.2317 |
cs.CC |
Algorithms for Quantum Branching Programs Based on Fingerprinting |
|
N |
0911.2036 |
cs.CR |
Security Theorems via Model Theory |
|
N |
0911.2035 |
cs.LO |
Modal Logic and the Approximation Induction Principle |
|
N |
0911.2034 |
cs.LO |
Expressing the Behavior of Three Very Different Concurrent Systems by Using Natural Extensions of Separation Logic |
|
N |
0911.2033 |
cs.FL |
Almost Linear B\"uchi Automata |
|
N |
0911.1862 |
cs.LO |
Characteristic Formulae for Fixed-Point Semantics: A General Framework |
|
N |
0910.4420 |
cs.CR |
Proceedings 7th International Workshop on Security Issues in Concurrency |
|
N |
0910.4342 |
cs.CR |
Fair Exchange in Strand Spaces |
|
N |
0910.4053 |
cs.CR |
Heuristic Methods for Security Protocols |
|
N |
0910.4056 |
cs.CR |
A User Model for Information Erasure |
|
N |
0910.4044 |
cs.CR |
How to Work with Honest but Curious Judges? (Preliminary Report) |
|
N |
0910.4033 |
cs.CR |
Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions |
|
N |
0910.1605 |
cs.CE |
Proceedings Second International Workshop on Computational Models for Cell Processes |
|
N |
0910.1418 |
q-bio.QM |
Modelling an Ammonium Transporter with SCLS |
|
N |
0910.1415 |
q-bio.MN |
A study on the combined interplay between stochastic fluctuations and the number of flagella in bacterial chemotaxis |
|
N |
0910.1412 |
cs.DM |
Dynamical and Structural Modularity of Discrete Regulatory Networks |
|
N |
0910.1410 |
cs.PL |
Quantifying the implicit process flow abstraction in SBGN-PD diagrams with Bio-PEPA |
|
N |
0910.1406 |
cs.PL |
Hybrid Semantics of Stochastic Programs with Dynamic Reconfiguration |
|
N |
0910.1404 |
cs.AI |
Proceedings 6th International Workshop on Local Search Techniques in Constraint Satisfaction |
|
N |
0910.1266 |
cs.AI |
Toward an automaton Constraint for Local Search |
|
N |
0910.1264 |
cs.AI |
Parallel local search for solving Constraint Problems on the Cell Broadband Engine (Preliminary Results) |
|
N |
0910.1255 |
cs.AI |
Sonet Network Design Problems |
|
N |
0910.1253 |
cs.AI |
A Constraint-directed Local Search Approach to Nurse Rostering Problems |
|
N |
0910.1247 |
cs.AI |
Integrating Conflict Driven Clause Learning to Local Search |
|
N |
0910.1244 |
cs.AI |
On Improving Local Search for Unsatisfiability |
|
N |
0910.1239 |
cs.AI |
Dynamic Demand-Capacity Balancing for Air Traffic Management Using Constraint-Based Local Search: First Results |
|
N |
0910.1238 |
cs.AI |
A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract) |
|
N |
0910.1219 |
q-bio.QM |
On the Interpretation of Delays in Delay Stochastic Simulation of Biological Systems |
|
N |
0910.1217 |
cs.FL |
Mutual Mobile Membranes with Timers |
|
N |
0910.0928 |
cs.CE |
BioDiVinE: A Framework for Parallel Analysis of Biological Models |
|
N |
0909.5479 |
cs.CC |
Proceedings Fourth Athens Colloquium on Algorithms and Complexity |
|
N |
0909.5038 |
cs.CC |
An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas |
|
N |
0909.5033 |
cs.DM |
Regular Matroids with Graphic Cocircuits |
|
N |
0909.5032 |
cs.DM |
Cartesian product of hypergraphs: properties and algorithms |
|
N |
0909.5029 |
cs.CC |
Complexity of Strong Implementability |
|
N |
0909.4479 |
quant-ph |
Information Flow in Secret Sharing Protocols |
|
N |
0907.5257 |
cs.FL |
Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems |
|
N |
0907.5136 |
cs.FL |
Capacity Bounded Grammars and Petri Nets |
|
N |
0907.5132 |
cs.FL |
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement |
|
N |
0907.5130 |
cs.FL |
Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections |
|
N |
0907.5128 |
cs.FL |
Bounded Languages Meet Cellular Automata with Sparse Communication |
|
N |
0907.5072 |
cs.FL |
Nondeterministic State Complexity of Positional Addition |
|
N |
0907.5063 |
cs.FL |
On Measuring Non-Recursive Trade-Offs |
|
N |
0907.5127 |
cs.FL |
Translation from Classical Two-Way Automata to Pebble Two-Way Automata |
|
N |
0907.5124 |
cs.FL |
State Complexity Approximation |
|
N |
0907.5121 |
cs.FL |
On Languages Accepted by P/T Systems Composed of joins |
|
N |
0907.5120 |
cs.FL |
On the Number of Membranes in Unary P Systems |
|
N |
0907.5119 |
cs.FL |
On the Size Complexity of Non-Returning Context-Free PC Grammar Systems |
|
N |
0907.5111 |
cs.FL |
On the Shuffle Automaton Size for Words |
|
N |
0907.5083 |
cs.FL |
Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems |
|
N |
0907.5058 |
cs.FL |
Testing the Equivalence of Regular Languages |
|
N |
0907.5055 |
cs.FL |
Mutation of Directed Graphs -- Corresponding Regular Expressions and Complexity of Their Generation |
|
N |
0907.4760 |
cs.FL |
Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability |
|
N |
0907.4554 |
cs.FL |
The Nondeterministic Waiting Time Algorithm: A Review |
|
N |
0907.4547 |
cs.FL |
Quotient Complexity of Regular Languages |
|
N |
0906.4900 |
cs.SE |
Proceedings Fourth European Young Researchers Workshop on Service Oriented Computing |
|
N |
0906.4612 |
cs.CC |
Proceedings International Workshop on The Complexity of Simple Programs |
|
N |
0906.4302 |
cs.DC |
A Peer to Peer Protocol for Online Dispute Resolution over Storage Consumption |
|
N |
0906.4162 |
cs.CC |
A Divergence Formula for Randomness and Dimension (Short Version) |
|
N |
0906.4149 |
cs.SE |
Adaptive Process Management in Highly Dynamic and Pervasive Scenarios |
|
N |
0906.3930 |
cs.SE |
Towards a Unifying View of QoS-Enhanced Web Service Description and Discovery Approaches |
|
N |
0906.3926 |
cs.AI |
Soft Constraints for Quality Aspects in Service Oriented Architectures |
|
N |
0906.3925 |
cs.OH |
Towards Activity Context using Software Sensors |
|
N |
0906.3924 |
cs.SE |
Service-oriented Context-aware Framework |
|
N |
0906.3921 |
cs.SE |
Fairness as a QoS Measure for Web Services |
|
N |
0906.3920 |
cs.PL |
Reasoning About a Service-oriented Programming Paradigm |
|
N |
0906.3916 |
cs.SE |
An Introduction to Simulation-Based Techniques for Automated Service Composition |
|
N |
0906.3332 |
cs.CC |
Complexity through the Observation of Simple Systems |
|
N |
0906.3329 |
cs.CC |
On the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results |
|
N |
0906.3327 |
cs.CC |
On acceptance conditions for membrane systems: characterisations of L and NL |
|
N |
0906.3306 |
cs.CC |
Self-Assembly of Infinite Structures |
|
N |
0906.3257 |
cs.LO |
Busy beavers gone wild |
|
N |
0906.3256 |
cs.GT |
Playing With Population Protocols |
|
N |
0906.3251 |
cs.CC |
Limitations of Self-Assembly at Temperature One (extended abstract) |
|
N |
0906.3248 |
cs.CC |
A Concrete View of Rule 110 Computation |
|
N |
0906.3235 |
cs.IT |
Simplicity via Provability for Universal Prefix-free Turing Machines |
|
N |
0906.3231 |
cs.CC |
New Choice for Small Universal Devices: Symport/Antiport P Systems |
|
N |
0906.3228 |
cs.CC |
Computational Processes and Incompleteness |
|
N |
0906.3227 |
cs.CC |
A Particular Universal Cellular Automaton |
|
N |
0906.3225 |
cs.CC |
Small Turing universal signal machines |
|
N |
0906.3213 |
cs.CC |
Intrinsically Universal Cellular Automata |
|
N |
0906.3208 |
cs.CC |
Representing a P-complete problem by small trellis automata |
|
N |
0906.3051 |
cs.CC |
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems |
|
N |
0906.3119 |
cs.CC |
Computational Power of P Systems with Small Size Insertion and Deletion Rules |
|
N |
0906.3199 |
cs.CC |
Some Considerations on Universality |
|
N |
0906.3197 |
cs.CC |
On the injectivity of the global function of a cellular automaton in the hyperbolic plane (extended abstract) |
|
N |
0906.3186 |
cs.CC |
A General Notion of Useful Information |
|
N |
You own 468 articles, have submitted 531 articles and are registered as the author of 0 articles. Visit Change Author Status if you are incorrectly registered as an author or a non-author of any articles you own. If you are the author of articles that aren't listed here, ask the submitter for the paper password for your articles, and claim ownership of the articles. If you no longer have the paper password, request ownership.
No public author identifier has been set for your account, see author identifier help or you may set a public author identifier.