ENTCS 2010 - PDF Preprint Papers

ENTCS 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ENTCS-2010 Paper

click to vote

ENTCS
2010

410views more ENTCS 2010»

TOOL PAPER: ScalaBison Recursive Ascent-Descent Parser Generator

13 years 9 months ago

Download www.cs.uwm.edu

ScalaBison is a parser generator accepting bison syntax and generating a parser in Scala. The generated parser uses the idea of "recursive ascent-descent parsing," that ...

John Boyland, Daniel Spiewak

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	410	TOOL PAPER: ScalaBison Recursive Ascent-Descent Parser Generator	claim
2	208	Accelerated Invariant Generation for C Programs with Aspic and C2fsm	claim
3	173	A Boolean Algebra of Contracts for Assume-guarantee Reasoning	claim
4	165	Correct Execution of Reconfiguration for Stateful Components	claim
5	161	Bone Remodelling in BioShape	claim
6	154	Process Algebra with Hooks for Models of Pattern Formation	claim
7	144	Integrating Component Tests to System Tests	claim
8	141	Debugging as a Science, that too, when your Program is Changing	claim
9	139	Spartacus: A Tableau Prover for Hybrid Logic	claim
10	136	A Solver for Modal Fixpoint Logics	claim
11	133	Towards Measurable Types for Dynamical Process Modeling Languages	claim
12	133	Inference of Session Types From Control Flow	claim
13	130	Asynchronous Components with Futures: Semantics and Proofs in Isabelle/HOL	claim
14	130	Compositional System Security with Interface-Confined Adversaries	claim
15	130	Structural Operational Semantics and Modal Logic, Revisited	claim
16	127	Action Prefixes: Reified Synchronization Paths in Minimal Component Interaction Automata	claim
17	127	Combining Model Reductions	claim
18	125	Concrete Memory Models for Shape Analysis	claim
19	123	Behaviour-Driven Development of Foundational UML Components	claim
20	123	Combining Architecture-based Software Reliability Predictions with Financial Impact Calculations	claim
21	122	Composition of Services with Constraints	claim
22	122	Efficient Earley Parsing with Regular Right-hand Sides	claim
23	120	Simulation and Synthesis of Deduction Calculi	claim
24	120	Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings	claim
25	120	Credo Methodology: Modeling and Analyzing A Peer-to-Peer System in Credo	claim
26	119	Bio-PEPA for Epidemiological Models	claim
27	119	Coalition Description Logic with Individuals	claim
28	119	A Tableau Method for Checking Rule Admissibility in S4	claim
29	118	Fragments-based Model Reduction: Some Case Studies	claim
30	118	Systematic Refinement of Performance Models for Concurrent Component-based Systems	claim
31	118	Transaction Scripts: Making Implicit Scenarios Explicit	claim
32	117	Categorifying Computations into Components via Arrows as Profunctors	claim
33	116	A Categorical Setting for Lower Complexity	claim
34	114	On Rule Formats for Zero and Unit Elements	claim
35	113	Geometry of Synthesis II: From Games to Delay-Insensitive Circuits	claim
36	113	Automated Computing of the Maximal Number of Handled Clients for Client-Server Systems	claim
37	112	From Coalgebraic to Monoidal Traces	claim
38	111	Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics	claim
39	111	Modular Verification of Interactive Systems with an Application to Biology	claim
40	111	Fundamental Nano-Patterns to Characterize and Classify Java Methods	claim
41	110	Modelling Interactive Experience, Function and Performance in Ubiquitous Systems	claim
42	110	Formalizing Homogeneous Language Embeddings	claim
43	110	Domain-Specific Languages for Composable Editor Plugins	claim
44	108	Integrating Textual and Graphical Modelling Languages	claim
45	107	PobSAM: Policy-based Managing of Actors in Self-Adaptive Systems	claim
46	105	From Focalization of Logic to the Logic of Focalization	claim
47	104	Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis	claim
48	104	Relating PDEs in Cylindrical Coordinates and CTMCs with Levels of Concentration	claim
49	103	A Model and Analysis of the AKAP Scaffold	claim
50	103	Model Testing Asynchronously Communicating Objects using Modulo AC Rewriting	claim
51	102	Test Case Generation for Adequacy of Floating-point to Fixed-point Conversion	claim
52	101	Strengthening the Zipper	claim
53	99	State Based Robustness Testing for Components	claim
54	99	Describing Secure Interfaces with Interface Automata	claim
55	98	Static Analysis by Abstract Interpretation: A Mathematical Programming Approach	claim
56	97	A Framework for Modelling and Simulating Networks of Cells	claim
57	96	Optimizing Conditional Logic Reasoning within CoLoSS	claim
58	96	Programming in Biomolecular Computation	claim
59	95	Quadtrees as an Abstract Domain	claim
60	94	Future Path-components in Directed Topology	claim
61	93	Bialgebras in Rel	claim
62	92	Two Ways to Common Knowledge	claim
63	91	A Unified Display Proof Theory for Bunched Logic	claim
64	90	Recursive Program Schemes and Context-Free Monads	claim
65	89	Categorical Models for Simply Typed Resource Calculi	claim
66	89	Coalgebraic Representation Theory of Fractals	claim
67	89	The Interval Analysis of Multilinear Expressions	claim
68	88	On the Observable Behaviour of Composite Components	claim
69	88	Coinduction in Concurrent Timed Systems	claim
70	88	On Coalgebras over Algebras	claim
71	88	Range and Set Abstraction using SAT	claim
72	86	Applications of Algebra and Coalgebra in Scientific Modelling: Illustrated with the Logistic Map	claim
73	85	Global Coordination Policies for Services	claim
74	84	Higher-order Algebras and Coalgebras from Parameterized Endofunctors	claim
75	84	Resource Modeling for Timed Creol Models	claim
76	84	Syntactic Language Extension via an Algebra of Languages and Transformations	claim
77	82	A Strict-Observational Interface Theory for Analysing Service Orchestrations	claim
78	82	A Modular Static Analysis Approach to Affine Loop Invariants Detection	claim
79	82	Reversible Computation and Reversible Programming Languages	claim
80	80	OOPS: An S5n Prover for Educational Settings	claim
81	77	Transparent First-class Futures and Distributed Components	claim
82	77	Understanding Game Semantics Through Coherence Spaces	claim
83	75	A Lightweight Approach to Customizable Composition Operators for Java-like Classes	claim
84	75	Semi-Automatic Specification of Behavioural Service Adaptation Contracts	claim
85	74	Fairness, Resources, and Separation	claim
86	73	Full Abstraction Without Synchronization Primitives	claim
87	72	Towards Context Independent Extra-functional Properties Descriptor for Components	claim
88	72	View-Augmented Abstractions	claim
89	71	Unifying Architectural and Behavioural Specifications of Distributed Components	claim
90	68	A Massively Scalable Architecture For Instant Messaging & Presence	claim
91	68	Library Concepts for Model Reuse	claim
92	67	A Pure Object-Oriented Embedding of Attribute Grammars	claim
93	66	A Nominal Relational Model for Local Store	claim
94	66	Reversible Computer Hardware	claim
95	65	Reasoning about QoS Contracts in the Probabilistic Duration Calculus	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers