Pages that link to "Item:Q175862"

The following pages link to The Journal of Logic and Algebraic Programming (Q175862):

Displaying 50 items.

• Permission to speak: a logic for access control and conformance (Q615900) (← links)
• Axiomatizability of representable domain algebras (Q624383) (← links)
• Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas (Q624386) (← links)
• A decentralised graphical implementation of mobile ambients (Q624388) (← links)
• Timed mobility in process algebra and Petri nets (Q638567) (← links)
• Structural operational semantics through context-dependent behaviour (Q638568) (← links)
• On system rollback and totalized fields: an algebraic approach to system change (Q649582) (← links)
• Efficiency issues in the KBMAG procedure (Q649584) (← links)
• Simple feature engineering via neat default retrenchments (Q649587) (← links)
• Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas (Q649588) (← links)
• Special issue: Selected papers based on the presentations at the first workshop on quantitative formal methods, QFM 2009, as part of the 2nd formal methods world congress, FM 2009, Eindhoven, The Netherlands, November 2--6, 2009 (Q651944) (← links)
• Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language (Q652158) (← links)
• Generating counterexamples for quantitative safety specifications in probabilistic B (Q652160) (← links)
• Extended beam search for non-exhaustive state space analysis (Q652163) (← links)
• Part special issue: Formal languages and analysis of contract-oriented software (FLACOS'10). Selected papers based on the presentations at the 4th workshop, Pisa, Italy, September 17--18, 2010. (Q663511) (← links)
• Special issue: The 20th Nordic workshop on programming theory (NWPT 2008). Selected papers based on the presentations at the workshop, Tallinn, Estonia, November 19-21, 2008 (Q710344) (← links)
• Engineering constraint solvers for automatic analysis of probabilistic hybrid automata (Q710668) (← links)
• Composing model programs for analysis (Q710670) (← links)
• Relational bytecode correlations (Q710672) (← links)
• Eager and delayed contract monitoring for call-by-value and call-by-name evaluation (Q710673) (← links)
• Termination in higher-order concurrent calculi (Q710674) (← links)
• Lazy behavioral subtyping (Q710675) (← links)
• Synchronous Kleene algebra (Q710676) (← links)
• A formalisation of the copy-modify-merge approach to version control in MDE (Q710677) (← links)
• Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
• Quantitative analysis of weighted transition systems (Q710680) (← links)
• A trace-based model for multiparty contracts (Q764380) (← links)
• Synthesis of secure adaptors (Q764381) (← links)
• A centralized and a decentralized method to automatically derive choreography-conforming web service systems (Q764383) (← links)
• Regular algebra applied to language problems (Q817577) (← links)
• Relation-algebraic computation of fixed points with applications (Q817578) (← links)
• Kleene under a modal demonic star (Q817579) (← links)
• Interpretability of first-order linear temporal logics in fork algebras (Q817582) (← links)
• Kleene modules and linear languages (Q817584) (← links)
• On the complemented disk algebra (Q817585) (← links)
• Partiality. I: Embedding relation algebras (Q817586) (← links)
• Abstract abstract reduction (Q817587) (← links)
• Special issue: The 19th Nordic workshop on programming theory (NWPT 2007). Selected papers based on the presentations at the workshop, Oslo, Norway, October 10--12, 2007. (Q843020) (← links)
• Behavioral interface description of an object-oriented language with futures and promises (Q843206) (← links)
• A hardware independent parallel programming model (Q843208) (← links)
• Ready to preorder: an algebraic and general proof (Q843212) (← links)
• What is a sorting function? (Q843213) (← links)
• Transfinite semantics in the form of greatest fixpoint (Q843215) (← links)
• Securing interaction between threads and the scheduler in the presence of synchronization (Q843217) (← links)
• Proof optimization for partial redundancy elimination (Q843219) (← links)
• Dependently typed array programs don't go wrong (Q843222) (← links)
• Algebraic simulations (Q844884) (← links)
• Normal design algebra (Q844885) (← links)
• Quasi-Boolean encodings and conditionals in algebraic specification (Q844886) (← links)
• Axiomatizing the equational theory of regular tree languages (Q844887) (← links)