Search results for "csl"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
119	J. C. Tay, S. Y. Huang, Hiok Chai Quek	CSL (Part I): Modelling General N-ary, Logical CSPs.	ICTAI	1997	DBLP DOI BibTeX RDF	constraint specification language, CSL, user-defined constraints, N-ary logical constraint satisfaction problems, constraint logic programming languages, expressive algebra, extended versions, transparent access, data structures, constraint programming, unification, syntax, logic programming languages, numerical constraints
92	Davide Cerotti, Susanna Donatelli, András Horváth, Jeremy Sproston	CSL Model Checking for Generalized Stochastic Petri Nets.	QEST	2006	DBLP DOI BibTeX RDF
91	José M. Martínez, Boudewijn R. Haverkort	MathMC: A Mathematica-Based Tool for CSL Model Checking of Deterministic and Stochastic Petri Nets.	QEST	2006	DBLP DOI BibTeX RDF	DSPNs, CSL, model checking, Markov process, Markov regenerative process
90	J. C. Tay, S. Y. Huang, Hiok Chai Quek	CSL (Part II): Modelling General N-ary, Logical CSPs.	ICTAI	1997	DBLP DOI BibTeX RDF	CSL algebra, constraint specification language, n-ary logical constraint satisfaction problem, executable data structures, binary CSP algorithms, design, compiler, implementation, constraint handling
84	Yajuan He, Chip-Hong Chang, Jiangmin Gu	An area efficient 64-bit square root carry-select adder for low power applications.	ISCAS (4)	2005	DBLP DOI BibTeX RDF
81	Régis Alenda, Nicola Olivetti, Camilla Schwind, Dmitry Tishkovsky	Tableau Calculi for CSL\mathcal{CSL} over minspaces.	CSL	2010	DBLP DOI BibTeX RDF
78	Marta Z. Kwiatkowska, Gethin Norman, António Pacheco 0001	Model Checking CSL until Formulae with Random Time Bounds.	PAPM-PROBMIV	2002	DBLP DOI BibTeX RDF
70	Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu	A Logic-Based Framework for Reasoning about Composite Data Structures.	CONCUR	2009	DBLP DOI BibTeX RDF
70	Susanna Donatelli, Serge Haddad, Jeremy Sproston	CSLTA: an Expressive Logic for Continuous-Time Markov Chains.	QEST	2007	DBLP DOI BibTeX RDF
70	Xinyu Feng 0001, Rodrigo Ferreira, Zhong Shao	On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning.	ESOP	2007	DBLP DOI BibTeX RDF
70	Peter G. Neumann	Risks to the public in computers and related systems.	ACM SIGSOFT Softw. Eng. Notes	2004	DBLP DOI BibTeX RDF
70	Maria Aparecida M. Souto, Regina Verdin, Ricardo Wainer, Milton Madeira, Mariusa Warpechowski, Karine Beschoren, Renata Zanella, Juarez Sagebin Correa, Rosa Maria Vicari, José Palazzo M. de Oliveira	Towards an Adaptive Web Training Environment Based on Cognitive Style of Learning: An Empirical Approach.	AH	2002	DBLP DOI BibTeX RDF
70	Hiok-Tiaq Ng, David J. Allstot	CMOS current steering logic for low-voltage mixed-signal integrated circuits.	IEEE Trans. Very Large Scale Integr. Syst.	1997	DBLP DOI BibTeX RDF
68	Yu-Ju Lan, Yao-Ting Sung, Chia-Yu Wu, Rui-Lin Wang, Kuo-En Chang	A Cognitive-Interactive Approach to Chinese Characters Learning: System Design and Development.	Edutainment	2009	DBLP DOI BibTeX RDF	romantic radicals, Chinese as a foreign/ second language (CFL/CSL), cognitive-interactive, Chinese character
68	Stephen S. Yau, Yu Wang 0015, Dazhi Huang, Hoh Peter In	Situation-Aware Contract Specification Language for Middleware for Ubiquitous Computing.	FTDCS	2003	DBLP DOI BibTeX RDF	Situation-Aware Contract Specification Language (SA-CSL), Reconfigurable Context-Sensitive Middleware (RCSM), security, Quality of Service (QoS), Ubiquitous computing, real time, middleware, situation-awareness, Aspect-Oriented Software Development (AOSD)
64	Susanna Donatelli, Serge Haddad, Jeremy Sproston	Model Checking Timed and Stochastic Properties with CSL^{TA}.	IEEE Trans. Software Eng.	2009	DBLP DOI BibTeX RDF
64	Davide Cerotti, Davide D'Aprile, Susanna Donatelli, Jeremy Sproston	Verifying Stochastic Well-formed Nets with CSL Model-Checking Tools.	ACSD	2006	DBLP DOI BibTeX RDF
64	Jeremy Sproston, Susanna Donatelli	Backward Stochastic Bisimulation in CSL Model Checking.	QEST	2004	DBLP DOI BibTeX RDF
64	Davide D'Aprile, Susanna Donatelli, Jeremy Sproston	CSL Model Checking for the GreatSPN Tool.	ISCIS	2004	DBLP DOI BibTeX RDF
59	Simona Ronchi Della Rocca (eds.)	Computer Science Logic 2013 (CSL 2013), CSL 2013, September 2-5, 2013, Torino, Italy	CSL	2013	DBLP BibTeX RDF
59	Antti Kuusisto	Modal Logic and Distributed Message Passing Automata.	CSL	2013	DBLP DOI BibTeX RDF
59	Federico Aschieri, Stefano Berardi, Giovanni Birolo	Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1.	CSL	2013	DBLP DOI BibTeX RDF
59	Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom	Deciding the weak definability of Büchi definable tree languages.	CSL	2013	DBLP DOI BibTeX RDF
59	Rick Statman	A New Type Assignment for Strongly Normalizable Terms.	CSL	2013	DBLP DOI BibTeX RDF
59	Pietro Galliani, Lauri Hella	Inclusion Logic and Fixed Point Logic.	CSL	2013	DBLP DOI BibTeX RDF
59	Paul-André Melliès	On dialogue games and coherent strategies.	CSL	2013	DBLP DOI BibTeX RDF
59	Marcin Bilkowski, Michal Skrzypczak	Unambiguity and uniformization problems on infinite trees.	CSL	2013	DBLP DOI BibTeX RDF
59	Krishnendu Chatterjee, Nathanaël Fijalkow	Infinite-state games with finitary conditions.	CSL	2013	DBLP DOI BibTeX RDF
59	Frederik Harwath, Nicole Schweikardt	On the locality of arb-invariant first-order logic with modulo counting quantifiers.	CSL	2013	DBLP DOI BibTeX RDF
59	Amaldev Manuel, Thomas Zeume	Two-Variable Logic on 2-Dimensional Structures.	CSL	2013	DBLP DOI BibTeX RDF
59	Julian C. Bradfield	Team building in dependence.	CSL	2013	DBLP DOI BibTeX RDF
59	Pierre Boudes, Fanny He, Michele Pagani	A characterization of the Taylor expansion of lambda-terms.	CSL	2013	DBLP DOI BibTeX RDF
59	Susumu Nishimura	A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables.	CSL	2013	DBLP DOI BibTeX RDF
59	Daniel Leivant	Global semantic typing for inductive and coinductive computing.	CSL	2013	DBLP DOI BibTeX RDF
59	Christopher Hampson, Agi Kurucz	One-variable first-order linear temporal logics with counting.	CSL	2013	DBLP DOI BibTeX RDF
59	Paul Hunter	When is Metric Temporal Logic Expressively Complete?.	CSL	2013	DBLP DOI BibTeX RDF
59	Kentaro Kikuchi	Proving Strong Normalisation via Non-deterministic Translations into Klop's Extended lambda-Calculus.	CSL	2013	DBLP DOI BibTeX RDF
59	Jakub Michaliszyn, Jan Otop	Elementary Modal Logics over Transitive Structures.	CSL	2013	DBLP DOI BibTeX RDF
59	Nachum Dershowitz	Res Publica: The Universal Model of Computation (Invited Talk).	CSL	2013	DBLP DOI BibTeX RDF
59	Pietro Di Gianantonio, Marina Lenisa	Innocent Game Semantics via Intersection Type Assignment Systems.	CSL	2013	DBLP DOI BibTeX RDF
59	Jérôme Fortier, Luigi Santocanale	Cuts for circular proofs: semantics and cut-elimination.	CSL	2013	DBLP DOI BibTeX RDF
59	Jean-Yves Girard 0001	Three lightings of logic (Invited Talk).	CSL	2013	DBLP DOI BibTeX RDF
59	Stefan Göller	The Fixed-Parameter Tractability of Model Checking Concurrent Systems.	CSL	2013	DBLP DOI BibTeX RDF
59	Dexter Kozen, Konstantinos Mamouras	Kleene Algebra with Products and Iteration Theories.	CSL	2013	DBLP DOI BibTeX RDF
59	Andrei A. Bulatov, Víctor Dalmau, Marc Thurley	Descriptive complexity of approximate counting CSPs.	CSL	2013	DBLP DOI BibTeX RDF
59	Christopher H. Broadbent, Naoki Kobayashi 0001	Saturation-Based Model Checking of Higher-Order Recursion Schemes.	CSL	2013	DBLP DOI BibTeX RDF
59	Ranald Clouston, Jeremy E. Dawson, Rajeev Goré, Alwen Tiu	Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic.	CSL	2013	DBLP DOI BibTeX RDF
59	Kaveh Ghasemloo, Stephen A. Cook	Theories for Subexponential-size Bounded-depth Frege Proofs.	CSL	2013	DBLP DOI BibTeX RDF
59	Qian Wang, Bruno Barras	Semantics of Intensional Type Theory extended with Decidable Equational Theories.	CSL	2013	DBLP DOI BibTeX RDF
59	Isabel Oitavem	From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk).	CSL	2013	DBLP DOI BibTeX RDF
59	Johannes Schmidt 0001, Michal Wrona	The Complexity of Abduction for Equality Constraint Languages.	CSL	2013	DBLP DOI BibTeX RDF
59	Yoshihiro Maruyama	Categorical Duality Theory: With Applications to Domains, Convexity, and the Distribution Monad.	CSL	2013	DBLP DOI BibTeX RDF
59	Stéphane Gimenez, Georg Moser	The Structure of Interaction.	CSL	2013	DBLP DOI BibTeX RDF
59	Neelakantan R. Krishnaswami, Derek Dreyer	Internalizing Relational Parametricity in the Extensional Calculus of Constructions.	CSL	2013	DBLP DOI BibTeX RDF
59	Marek Materzok	Axiomatizing Subtyped Delimited Continuations.	CSL	2013	DBLP DOI BibTeX RDF
59	Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol	What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives.	CSL	2013	DBLP DOI BibTeX RDF
59		Frontmatter, Table of Contents, Preface, Conference Organization.	CSL	2013	DBLP DOI BibTeX RDF
59	Lionel Rieg	Extracting Herbrand trees in classical realizability using forcing.	CSL	2013	DBLP DOI BibTeX RDF
59	Pietro Galliani, Miika Hannula, Juha Kontinen	Hierarchies in independence logic.	CSL	2013	DBLP DOI BibTeX RDF
59	Lidia Tendera	Means and Limits of Decision (Invited Talk).	CSL	2013	DBLP DOI BibTeX RDF
59	Bahareh Afshari, Graham E. Leigh	On closure ordinals for the modal mu-calculus.	CSL	2013	DBLP DOI BibTeX RDF
59	Anuj Dawar, Thomas A. Henzinger, Damian Niwinski	The Ackermann Award 2013.	CSL	2013	DBLP DOI BibTeX RDF
59	Christoph Berkholz, Andreas Krebs, Oleg Verbitsky 0001	Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy.	CSL	2013	DBLP DOI BibTeX RDF
59	Patrick Cégielski, Arnaud Durand 0001 (eds.)	Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France	CSL	2012	DBLP BibTeX RDF
59	Alexander Leitsch, Giselle Reis, Bruno Woltzenlogel Paleo	Towards CERes in intuitionistic logic.	CSL	2012	DBLP DOI BibTeX RDF
59	Zhilin Wu	Commutative Data Automata.	CSL	2012	DBLP DOI BibTeX RDF
59	Nathalie Bertrand 0001, John Fearnley, Sven Schewe	Bounded Satisfiability for PCTL.	CSL	2012	DBLP DOI BibTeX RDF
59	Thorsten Altenkirch, Ondrej Rypacek	A Syntactical Approach to Weak omega-Groupoids.	CSL	2012	DBLP DOI BibTeX RDF
59	Jacek Chrzaszcz, Aleksy Schubert	ML with PTIME complexity guarantees.	CSL	2012	DBLP DOI BibTeX RDF
59	Manuel Bodirsky, Michal Wrona	Equivalence Constraint Satisfaction Problems.	CSL	2012	DBLP DOI BibTeX RDF
59	Emanuel Kieronski, Jakub Michaliszyn	Two-Variable Universal Logic with Transitive Closure.	CSL	2012	DBLP DOI BibTeX RDF
59		Frontmatter, Table of Contents, Preface, Conference Organization.	CSL	2012	DBLP DOI BibTeX RDF
59	Henry DeYoung, Luís Caires, Frank Pfenning, Bernardo Toninho	Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication.	CSL	2012	DBLP DOI BibTeX RDF
59	Stefano Berardi, Ugo de'Liguoro	Knowledge Spaces and the Completeness of Learning Strategies.	CSL	2012	DBLP DOI BibTeX RDF
59	Boris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn	Bounded Combinatory Logic.	CSL	2012	DBLP DOI BibTeX RDF
59	Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa	Definability of linear equation systems over groups and rings.	CSL	2012	DBLP DOI BibTeX RDF
59	Inês Lynce	Satisfiability: where Theory meets Practice (Invited Talk).	CSL	2012	DBLP DOI BibTeX RDF
59	Chantal Keller, Marc Lasson	Parametricity in an Impredicative Sort.	CSL	2012	DBLP DOI BibTeX RDF
59	Patrick Baillot, Ugo Dal Lago	Higher-Order Interpretations and Program Complexity.	CSL	2012	DBLP DOI BibTeX RDF
59	Lukasz Kaiser, Simon Leßenich	A Counting Logic for Structure Transition Systems.	CSL	2012	DBLP DOI BibTeX RDF
59	Thomas Ehrhard	Collapsing non-idempotent intersection types.	CSL	2012	DBLP DOI BibTeX RDF
59	Lars Birkedal, Filip Sieczkowski, Jacob Thamsborg	A Concurrent Logical Relation.	CSL	2012	DBLP DOI BibTeX RDF
59	Serge Abiteboul	Sharing Distributed Knowledge on the Web (Invited Talk).	CSL	2012	DBLP DOI BibTeX RDF
59	Stephen A. Cook	Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk).	CSL	2012	DBLP DOI BibTeX RDF
59	Thierry Coquand, Anuj Dawar, Damian Niwinski	The Ackermann Award 2012.	CSL	2012	DBLP DOI BibTeX RDF
59	Tomer Kotek, Johann A. Makowsky	Connection Matrices and the Definability of Graph Parameters.	CSL	2012	DBLP DOI BibTeX RDF
59	Pawel Parys	Variants of Collapsible Pushdown Systems.	CSL	2012	DBLP DOI BibTeX RDF
59	Federico Aschieri	Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms.	CSL	2012	DBLP DOI BibTeX RDF
59	Robert Atkey	Relational Parametricity for Higher Kinds.	CSL	2012	DBLP DOI BibTeX RDF
59	Alberto Carraro, Antonino Salibra	On the equational consistency of order-theoretic models of the lambda-calculus.	CSL	2012	DBLP DOI BibTeX RDF
59	Jean-Pierre Jouannaud, Jianqi Li	Church-Rosser Properties of Normal Rewriting.	CSL	2012	DBLP DOI BibTeX RDF
59	Martin Grohe, Martin Otto 0001	Pebble Games and Linear Equations.	CSL	2012	DBLP DOI BibTeX RDF
59	Etienne Grandjean, Frédéric Olive	Descriptive complexity for pictures languages.	CSL	2012	DBLP DOI BibTeX RDF
59	Johann Brault-Baron	A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic.	CSL	2012	DBLP DOI BibTeX RDF
59	Dietrich Kuske	Isomorphisms of scattered automatic linear orders.	CSL	2012	DBLP DOI BibTeX RDF
59	Stefan Hetzl, Lutz Straßburger	Herbrand-Confluence for Cut Elimination in Classical First Order Logic.	CSL	2012	DBLP DOI BibTeX RDF
59	Manfred Kufleitner, Pascal Weil	The FO2 alternation hierarchy is decidable.	CSL	2012	DBLP DOI BibTeX RDF
59	Johann A. Makowsky	Definability and Complexity of Graph Parameters (Invited Talk).	CSL	2012	DBLP DOI BibTeX RDF
59	Erich Grädel, Simon Leßenich	Banach-Mazur Games with Simple Winning Strategies.	CSL	2012	DBLP DOI BibTeX RDF
59	Satoru Kuroda	Axiomatizing proof tree concepts in Bounded Arithmetic.	CSL	2012	DBLP DOI BibTeX RDF