BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
partial order
Google partial order

Tag #partial order

109 papers:

EDMEDM-2019-LiangYZPG #case study #concept #learning #strict
Active Learning of Strict Partial Orders: A Case Study on Concept Prerequisite Relations (CL0, JY, HZ0, BP, CLG).
OOPSLAOOPSLA-2019-ChatterjeePT #reduction
Value-centric dynamic partial order reduction (KC, AP, VT), p. 29.
CAVCAV-2019-Siegel #on the fly #reduction #what
What's Wrong with On-the-Fly Partial Order Reduction (SFS), pp. 478–495.
VMCAIVMCAI-2019-FoxSH #probability #reachability
Syntactic Partial Order Compression for Probabilistic Reachability (GF, DS, HH), pp. 446–467.
FMFM-2018-FanHM #approximate #reduction
Approximate Partial Order Reduction (CF, ZH, SM), pp. 588–607.
POPLPOPL-2018-ChalupaCPSV #reduction
Data-centric dynamic partial order reduction (MC, KC, AP, NS, KV), p. 30.
CAVCAV-2018-BonnelandJLMS #reduction
Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems (FMB, PGJ, KGL, MM, JS), pp. 527–546.
CAVCAV-2018-AlbertGIR #reduction
Constrained Dynamic Partial Order Reduction (EA, MGZ, MI, AR), pp. 392–410.
CAVCAV-2018-NguyenRSCP #reduction
Quasi-Optimal Partial Order Reduction (HTTN, CR, MS, CC, LP), pp. 354–371.
CAVCAV-2018-YuanYG #concurrent
Partial Order Aware Concurrency Sampling (XY, JY, RG), pp. 317–335.
ESOPESOP-2017-KhyzhaDGP #proving #using
Proving Linearizability Using Partial Orders (AK, MD, AG, MJP), pp. 639–667.
CAVCAV-2017-AlbertABGS #reduction
Context-Sensitive Dynamic Partial Order Reduction (EA, PA, MGdlB, MGZ, PJS), pp. 526–543.
ICSTICST-2016-GhafoorMS #database #effectiveness #model checking #reduction
Effective Partial Order Reduction in Model Checking Database Applications (MAG, MSM, JHS), pp. 146–156.
ICTSSICTSS-2016-Bochmann #consistency #specification #testing
Conformance Testing with Respect to Partial-Order Specifications (GvB), pp. 3–17.
VMCAIVMCAI-2016-Parizek #analysis #array #hybrid #reduction #source code
Hybrid Analysis for Partial Order Reduction of Programs with Arrays (PP), pp. 291–310.
LATALATA-2015-LeonM #set
Building Bridges Between Sets of Partial Orders (HPdL, AM), pp. 145–160.
PLDIPLDI-2015-ZhangKW #memory management #modelling #reduction
Dynamic partial order reduction for relaxed memory models (NZ, MK, CW), pp. 250–259.
PPoPPPPoPP-2015-ThomsonD #concurrent #lazy evaluation #reduction #testing
The lazy happens-before relation: better partial-order reduction for systematic concurrency testing (PT, AFD), pp. 259–260.
SEFMSEFM-2014-DobrikovL #model checking #optimisation #reduction #using
Optimising the ProB Model Checker for B Using Partial Order Reduction (ID, ML), pp. 220–234.
POPLPOPL-2014-AbdullaAJS #reduction
Optimal dynamic partial order reduction (PAA, SA, BJ, KFS), pp. 373–384.
ASEASE-2014-KusanoW #abstraction #optimisation #reduction
Assertion guided abstraction: a cooperative optimization for dynamic partial order reduction (MK, CW), pp. 175–186.
CAVCAV-2014-HansenLLN0 #abstraction #automaton #reduction #women
Diamonds Are a Girl’s Best Friend: Partial Order Reduction for Timed Automata with Abstractions (HH, SWL, YL, TKN, JS), pp. 391–406.
ICDARICDAR-2013-StammLD #analysis #approach #documentation #multi
Continuous Partial-Order Planning for Multichannel Document Analysis: A Process-Driven Approach (KS, ML, AD), pp. 626–630.
OOPSLAOOPSLA-2013-CoonsMM #bound #reduction
Bounded partial-order reduction (KEC, MM, KSM), pp. 833–848.
CAVCAV-2013-AlglaveKT #bound #concurrent #model checking #performance
Partial Orders for Efficient Bounded Model Checking of Concurrent Software (JA, DK, MT), pp. 141–157.
VMCAIVMCAI-2013-ZhengS0LD0 #network #reduction #using
State Space Reduction for Sensor Networks Using Two-Level Partial Order Reduction (MZ, DS, JS, YL, JSD, YG), pp. 515–535.
LATALATA-2012-Oliveira #generative
Canonizable Partial Order Generators (MdOO), pp. 445–457.
IFMIFM-J-2009-BenesBBCSV11 #automaton #component #ltl #reduction
Partial order reduction for state/event LTL with application to component-interaction automata (NB, LB, BB, IC, JS, PV), pp. 877–890.
ASEASE-2011-BokorKSS #reduction
Supporting domain-specific state space reductions through local partial-order reduction (PB, JK, MS, NS), pp. 113–122.
SACSAC-2011-DumasDBB #verification
Application of partial-order methods for the verification of closed-loop SDL systems (XD, PD, FB, EB), pp. 1666–1673.
TACASTACAS-2011-CimattiNR #abstraction #lazy evaluation #reduction
Boosting Lazy Abstraction for SystemC with Partial Order Reduction (AC, IN, MR), pp. 341–356.
RTARTA-2010-Bahr10a #term rewriting
Partial Order Infinitary Term Rewriting and Böhm Trees (PB), pp. 67–84.
SEFMSEFM-2010-BarnatBR #parallel #reduction
Parallel Partial Order Reduction with Topological Sort Proviso (JB, LB, PR), pp. 222–231.
FASEFASE-2010-LauterburgKMA #heuristic #reduction
Evaluating Ordering Heuristics for Dynamic Partial-Order Reduction Techniques (SL, RKK, DM, GA), pp. 308–322.
TACASTACAS-2010-MalinowskiN #automaton #bound #model checking #satisfiability #semantics
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata (JM, PN), pp. 405–419.
IJCARIJCAR-2010-ShermanGD #type system
A Slice-Based Decision Procedure for Type-Based Partial Orders (ES, BJG, MBD), pp. 156–170.
FMFM-2009-LangM #composition #confluence #detection #reduction #using
Partial Order Reductions Using Compositional Confluence Detection (FL, RM), pp. 157–172.
IFMIFM-2009-BenesBCSVZ #ltl #reduction
Partial Order Reduction for State/Event LTL (NB, LB, IC, JS, PV, BZ), pp. 307–321.
TLCATLCA-2009-FaggianP #linear
Partial Orders, Event Structures and Linear Strategies (CF, MP), pp. 95–111.
ICMLICML-2009-McFeeL #kernel #multi
Partial order embedding with multiple kernels (BM, GRGL), pp. 721–728.
RecSysRecSys-2009-QasimOWHO #recommendation
A partial-order based active cache for recommender systems (UQ, VO, YfBW, MEH, MTÖ), pp. 209–212.
STOCSTOC-2009-CardinalFJJM #algorithm #performance
An efficient algorithm for partial order production (JC, SF, GJ, RMJ, JIM), pp. 93–100.
CAVCAV-2009-KahlonWG #reduction
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique (VK, CW, AG), pp. 398–413.
DACDAC-2008-KunduGG #design #reduction #scalability #testing
Partial order reduction for scalable testing of systemC TLM designs (SK, MKG, RG), pp. 936–941.
DATEDATE-2008-MokhovY #configuration management #graph #synthesis
Conditional Partial Order Graphs and Dynamically Reconfigurable Control Synthesis (AM, AY), pp. 1142–1147.
TACASTACAS-2008-WangYKG #reduction
Peephole Partial Order Reduction (CW, ZY, VK, AG), pp. 382–396.
ICLPICLP-2008-CodishLS #constraints #problem
Telecommunications Feature Subscription as a Partial Order Constraint Problem (MC, VL, PJS), pp. 749–753.
FATESTestCom-FATES-2008-BochmannHJJ #automaton #testing
Testing Systems Specified as Partial Order Input/Output Automata (GvB, SH, CJ, GVJ), pp. 169–183.
CIAACIAA-2007-Volkov #automaton
Synchronizing Automata Preserving a Chain of Partial Orders (MVV), pp. 27–37.
ICEISICEIS-AIDSS-2007-Janicki
Pairwise Comparisons, Incomparability and Partial Orders (RJ), pp. 297–302.
ESEC-FSEESEC-FSE-2007-AcharyaXPX #api #mining #source code #specification
Mining API patterns as partial orders from source code: from usage scenarios to specifications (MA, TX, JP, JX), pp. 25–34.
SACSAC-2007-YangWK #analysis #modelling
General dominant relationship analysis based on partial order models (ZY, BW, MK), pp. 470–474.
WRLAWRLA-2006-FarzanM07 #programming language #reduction #semantics
Partial Order Reduction for Rewriting Semantics of Programming Languages (AF, JM), pp. 61–78.
FATESTestCom-FATES-2007-HaarJJ #automaton #testing
Testing Input/Output Partial Order Automata (SH, CJ, GVJ), pp. 171–185.
RTARTA-2006-CodishLS #constraints #termination
Solving Partial Order Constraints for LPO Termination (MC, VL, PJS), pp. 4–18.
QAPLQAPL-2005-BaierDG06 #branch #probability #reduction
Partial Order Reduction for Probabilistic Branching Time (CB, PRD, MG), pp. 97–116.
TACASTACAS-2006-NiebertP #ltl #model checking #performance
Efficient Model Checking for LTL with Partial Order Snapshots (PN, DP), pp. 272–286.
CAVCAV-2006-KahlonGS #concurrent #model checking #on the fly #source code #transaction #using
Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions (VK, AG, NS), pp. 286–299.
IFMIFM-2005-Lang #composition #flexibility #on the fly #verification
Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods (FL), pp. 70–88.
KDDKDD-2005-UkkonenFM
Finding partial orders from unordered 0-1 data (AU, MF, HM), pp. 285–293.
POPLPOPL-2005-FlanaganG #model checking #reduction
Dynamic partial-order reduction for model checking software (CF, PG), pp. 110–121.
FATESFATES-2005-PeledQ
Time Unbalanced Partial Order (DP, HQ), pp. 152–169.
ICGTICGT-2004-Casas-GarrigaB
Coproduct Transformations on Lattices of Closed Partial Orders (GCG, JLB), pp. 336–351.
FoSSaCSFoSSaCS-2004-GenestMMP #specification #using #verification
Specifying and Verifying Partial Order Properties Using Template MSCs (BG, MM, AM, DP), pp. 195–210.
TACASTACAS-2004-LugiezNZ #approach #automaton #explosion #problem #semantics
A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata (DL, PN, SZ), pp. 296–311.
RTARTA-2003-KhasidashviliG #semantics #term rewriting
Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication) (ZK, JRWG), pp. 467–482.
LICSLICS-2003-KhoussainovRS #automation #on the
On Automatic Partial Orders (BK, SR, FS), pp. 168–177.
DATEDATE-2002-BystrovKY #design #modelling #visualisation
Visualization of Partial Order Models in VLSI Design Flow (AVB, MK, AY), p. 1089.
ICALPICALP-2001-Nielsen #modelling #question #why
Modelling with Partial Orders — Why and Why Not? (MN), pp. 61–63.
ASEASE-2001-BastenB #clustering #process #reduction
Enhancing Partial-Order Reduction via Process Clustering (TB, DB), pp. 245–253.
TACASTACAS-2001-RuysLKLM #algebra #analysis #probability #process #using
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders (TCR, RL, JPK, DL, MM), pp. 220–235.
KDDKDD-2000-MannilaM
Global partial orders from sequential data (HM, CM), pp. 161–168.
TACASTACAS-2000-ClarkeJM #protocol #reduction #security #verification
Partial Order Reductions for Security Protocol Verification (EMC, SJ, WRM), pp. 503–518.
TACASTACAS-2000-KrimmM #communication #composition #generative #reduction
Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems (JPK, LM), pp. 266–282.
CAVCAV-2000-StollerUL #detection #distributed #performance #using
Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods (SDS, LU, YAL), pp. 264–279.
PASTEPASTE-1999-NaumovichCC #analysis #data flow #performance #using #verification
Using Partial Order Techniques to Improve Performance of Data Flow Analysis Based Verification (GN, LAC, JMC), pp. 57–65.
ICALPICALP-1998-AlurMP
Deciding Global Partial-Order Properties (RA, KLM, DP), pp. 41–52.
KRKR-1998-BaiolettiMM #constraints #encoding
Encoding Planning Constraints into Partial Order Planners (MB, SM, AM), pp. 608–616.
DATEDATE-1998-VercauterenVJL #analysis #performance #using #verification
Efficient Verification using Generalized Partial Order Analysis (SV, DV, GGdJ, BL), pp. 782–789.
TACASTACAS-1998-KurshanLMPY #reduction
Static Partial Order Reduction (RPK, VL, MM, DP, HY), pp. 345–357.
CAVCAV-1998-AbdullaJKP #approach #reduction #verification
A General Approach to Partial Order Reductions in Symbolic Verification (PAA, BJ, MK, DP), pp. 379–390.
CAVCAV-1998-Peled #reduction
Ten Years of Partial Order Reduction (DP), pp. 17–28.
RTARTA-1997-BechetGR #axiom
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders (DB, PdG, CR), pp. 230–240.
TACASTACAS-1997-EmersonJP #reduction #symmetry
Combining Partial Order and Symmetry Reductions (EAE, SJ, DP), pp. 19–34.
TAPSOFTTAPSOFT-1997-Thomas #automaton
Automata Theory on Trees and Partial Orders (WT), pp. 20–38.
CAVCAV-1997-AlurBHQR #reduction
Partial-Order Reduction in Symbolic State Space Exploration (RA, RKB, TAH, SQ, SKR), pp. 340–351.
CAVCAV-1997-KokkarinenPV #reduction
Relaxed Visibility Enhances Partial Order Reduction (IK, DP, AV), pp. 328–339.
KRKR-1996-Sharma #inheritance
Partial Orders of Sorts and Inheritances (or Placing Inheritance in Context) (NS), pp. 280–290.
TACASTACAS-1996-ChouP #model checking #reduction #verification
Formal Verification of a Partial-Order Reduction Technique for Model Checking (CTC, DP), pp. 241–257.
ISSTAISSTA-1996-GodefroidPS #concurrent #industrial #source code #using #validation
Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs (PG, DP, MGS), pp. 261–269.
LICSLICS-1996-WillemsW #branch #linear #model checking
Partial-Order Methods for Model Checking: From Linear Time to Branching Time (BW, PW), pp. 294–303.
SIGIRSIGIR-1995-Finch #documentation #representation
Partial Orders for Document Representation: A New Methodology for Combining Document Features (SF), pp. 264–272.
CAVCAV-1994-Peled #model checking #on the fly #reduction
Combining Partial Order Reductions with On-the-fly Model-Checking (DP), pp. 377–390.
ICALPICALP-1993-LodayaT #decidability #logic
Decidability of a Partial Order Based Temporal Logic (KL, PST), pp. 582–592.
HPDCHPDC-1993-AmerCCD #multi #reliability
Partial Order Transport Service for Multimedia Applications: Reliable Service (PDA, TJC, CC, MD), pp. 272–280.
CAVCAV-1993-GodefroidP #dependence #verification
Refining Dependencies Improves Partial-Order Verification Methods (PG, DP), pp. 438–449.
KRKR-1992-MintonDBP #performance
Total Order vs. Partial Order Planning: Factors Influencing Performance (SM, MD, JLB, ABP), pp. 83–92.
KRKR-1992-PenberthyW #named
UCPOP: A Sound, Complete, Partial Order Planner for ADL (JSP, DSW), pp. 103–114.
CAVCAV-1991-GodefroidW #concurrent #performance #safety #using #verification
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties (PG, PW), pp. 332–342.
CAVCAV-1991-ProbstL #model checking
Partial-Order Model Checking: A Guide for the Perplexed (DKP, HFL), pp. 322–331.
ICALPICALP-1990-PeledP #liveness #proving
Proving Partial Order Liveness Properties (DP, AP), pp. 553–571.
CAVCAV-1990-Godefroid #automation #using #verification
Using Partial Orders to Improve Automatic Verification Methods (PG), pp. 176–185.
CAVCAV-1990-ProbstL #explosion #problem #semantics #using
Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems (DKP, HFL), pp. 146–155.
POPLPOPL-1989-Parker #programming
Partial Order Programming (DSPJ), pp. 260–266.
STOCSTOC-1989-Kenyon-MathieuK #verification
Verifying Partial Orders (CKM, VK), pp. 367–374.
TAPSOFTCAAP-1987-BoudolC #concurrent #on the #semantics
On the Semantics of Concurrency: Partial Orders and Transition Systems (GB, IC), pp. 123–137.
LICSLICS-1987-GaifmanP #concurrent #modelling
Partial Order Models of Concurrency and the Computation of Functions (HG, VRP), pp. 72–85.
ICALPICALP-1984-Reisig #semantics
Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness (WR), pp. 403–413.
ICALPICALP-1983-SpinradV #2d #morphism #recognition
Recognition and Isomorphism of Two Dimensional Partial Orders (JPS, JV), pp. 676–686.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.