BibSLEIGH — state machine tag

state machine

state machine

Tag #state machine

226 papers:

ICPC-2019-SaidQK #embedded #modelling #question: Do extracted state machine models help to understand embedded software? (WS, JQ, RK), pp. 191–196.
SANER-2019-SaidQK #embedded #towards: Towards Understandable Guards of Extracted State Machines from Embedded Software (WS, JQ, RK), pp. 264–274.
ECOOP-2019-MukherjeeRGDRLR #framework #programming #reliability: Reliable State Machines: A Framework for Programming Reliable Cloud Services (SM, NJR, KG, PD, CR, AL, AR, RK), p. 29.
ASE-2019-AhmadiJD #named #testing #uml: mCUTE: A Model-Level Concolic Unit Testing Engine for UML State Machines (RA, KJ, JD), pp. 1182–1185.
ICTSS-2019-BombardaBGRDL #consistency #generative #protocol #refinement #testing #using: Combining Model Refinement and Test Generation for Conformance Testing of the IEEE PHD Protocol Using Abstract State Machines (AB, SB, AG, MR, FD, YL), pp. 67–85.
ICTSS-2019-TimoPR #finite #multi #mutation testing #testing: Multiple Mutation Testing for Timed Finite State Machine with Timed Guards and Timeouts (ONT, DP, AR), pp. 104–120.
TAP-2019-PetrenkoA #communication #learning: Learning Communicating State Machines (AP, FA), pp. 112–128.
ICSME-2018-SaidQK #embedded #mining #on the: On State Machine Mining from Embedded Control Software (WS, JQ, RK), pp. 138–148.
ICSME-2018-SaidQK18a #modelling #verification: Reflexion Models for State Machine Extraction and Verification (WS, JQ, RK), pp. 149–159.
MoDELS-2018-Petrenko #finite #testing #towards: Towards Testing from Finite State Machines with Symbolic Inputs and Outputs (AP), p. 187.
ICTSS-2018-BonfantiGM #c++ #modelling #validation: Validation of Transformation from Abstract State Machine Models to C++ Code (SB, AG, AM), pp. 17–32.
ICTSS-2018-TvardovskiiEY #fault #finite #testing: Deriving Tests with Guaranteed Fault Coverage for Finite State Machines with Timeouts (AT, KEF, NY), pp. 149–154.
CIAA-2017-KutribMW #finite: Transducing Reversibly with Finite State Machines (MK, AM, MW), pp. 151–162.
ESOP-2017-ChatterjeeKMP #algorithm #performance #recursion: Faster Algorithms for Weighted Recursive State Machines (KC, BK, SM, AP), pp. 287–313.
ICTSS-2017-Nguena-TimoPR #finite #multi #mutation testing #testing: Multiple Mutation Testing from Finite State Machines with Symbolic Inputs (ONT, AP, SR), pp. 108–125.
ICSME-2016-WalkinshawH #modelling: Inferring Computational State Machine Models from Program Executions (NW, MH), pp. 122–132.
ICPR-2016-WangL #named: D-LSM: Deep Liquid State Machine with unsupervised recurrent reservoir tuning (QW0, PL0), pp. 2652–2657.
MoDELS-2016-Kosiuczenko #contract #on the #protocol #synthesis: On the synthesis of protocol state machines from contracts (PK), pp. 76–85.
SLE-2016-LuoA #c #configuration management #modelling #named #programming #semantics: BSML-mbeddr: integrating semantically configurable state-machine models in a C programming environment (ZL, JMA), pp. 105–117.
CIAA-2015-KushikY #automaton #finite #nondeterminism #sequence: Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (NK, NY), pp. 188–198.
MoDELS-2015-DasD #uml: State machine antipatterns for UML-RT (TKD, JD), pp. 54–63.
MoDELS-2015-KhalilD #evolution #execution #incremental #symbolic computation: Incremental symbolic execution of evolving state machines (AK, JD), pp. 14–23.
PLDI-2015-DeligiannisDKLT #analysis #programming #testing: Asynchronous programming, analysis and testing with state machines (PD, AFD, JK, AL, PT), pp. 154–164.
POPL-2015-ChatterjeeIPG #algebra #algorithm #constant #performance #recursion: Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth (KC, RIJ, AP, PG), pp. 97–109.
HPDC-2015-PokeH #named #network #replication: DARE: High-Performance State Machine Replication on RDMA Networks (MP, TH), pp. 107–118.
FASE-2015-KnappMRG #uml: An Institution for Simple UML State Machines (AK, TM, MR, MG), pp. 3–18.
ICTSS-2015-GrozSPO #finite #identification #sequence #using: Inferring Finite State Machines Without Reset Using State Identification Sequences (RG, AdSS, AP, CO), pp. 161–177.
ICTSS-2015-KushikY #adaptation #finite #heuristic #nondeterminism #sequence: Heuristics for Deriving Adaptive Homing and Distinguishing Sequences for Nondeterministic Finite State Machines (NK, HY), pp. 243–248.
ICTSS-2015-PetrenkoS #finite: Checking Experiments for Finite State Machines with Symbolic Inputs (AP, AdSS), pp. 3–18.
ICSME-2014-KhanIA #approach #behaviour #heuristic #uml: A Heuristic-Based Approach to Refactor Crosscutting Behaviors in UML State Machines (MUK, MZI, SA), pp. 557–560.
ICALP-v2-2014-EmekLUW #finite #problem: Solving the ANTS Problem with Asynchronous Finite State Machines (YE, TL, JU, RW), pp. 471–482.
SEFM-2014-CasselHJS #finite #learning: Learning Extended Finite State Machines (SC, FH, BJ, BS), pp. 250–264.
SEFM-2014-RodriguezFHM #erlang #execution #uml #verification: Execution and Verification of UML State Machines with Erlang (RJR, LÅF, ÁHN, JM), pp. 284–289.
AMT-2014-ZhangBBEHKW #code generation #concurrent #java #towards: Towards Verified Java Code Generation from Concurrent State Machines (DZ, DB, MvdB, LE, CH, RK, AW), pp. 64–69.
SLE-2014-KaufmannKPSW #debugging #diagrams #satisfiability #sequence chart: A SAT-Based Debugging Tool for State Machines and Sequence Diagrams (PK, MK, AP, MS, MW), pp. 21–40.
ASPLOS-2014-MytkowiczMS #finite: Data-parallel finite-state machines (TM, MM, WS), pp. 529–542.
ASPLOS-2014-ZhaoWS #finite: Challenging the “embarrassingly sequential”: parallelizing finite state machine-based computations through principled speculation (ZZ, BW, XS), pp. 543–558.
HPDC-2014-MuCWZ #network #replication: When paxos meets erasure code: reduce network and storage cost in state machine replication (SM, KC, YW, WZ), pp. 61–72.
LCTES-2014-LezuoPK #compilation #named: CASM: optimized compilation of abstract state machines (RL, PP, AK), pp. 13–22.
WCRE-2013-WalkinshawTD #finite #modelling: Inferring Extended Finite State Machine models from software executions (NW, RT, JD), pp. 301–310.
CIAA-2013-KushikY #finite #nondeterminism #on the #sequence: On the Length of Homing Sequences for Nondeterministic Finite State Machines (NK, NY), pp. 220–231.
IFM-2013-LiuLACSWD #semantics #uml: A Formal Semantics for Complete UML State Machines with Communications (SL, YL, ÉA, CC, JS, BW, JSD), pp. 331–346.
ESEC-FSE-2013-LiuL0ZWD #model checking #named #self #uml: USMMC: a self-contained model checker for UML state machines (SL, YL, JS, MZ, BW, JSD), pp. 623–626.
DATE-2013-ZhuDNZ #finite #implementation #robust: Robust and extensible task implementations of synchronous finite state machines (QZ, PD, MDN, HZ), pp. 1319–1324.
ICST-2013-AliYB #empirical #quality #robust #testing: Assessing Quality and Effort of Applying Aspect State Machines for Robustness Testing: A Controlled Experiment (SA, TY, LCB), pp. 212–221.
ICTSS-2013-KushikEY #adaptation #finite #nondeterminism: Adaptive Homing and Distinguishing Experiments for Nondeterministic Finite State Machines (NK, KEF, NY), pp. 33–48.
IFM-2012-GarisPCR #alloy #protocol #specification #uml: Specifying UML Protocol State Machines in Alloy (AGG, ACRP, AC, DR), pp. 312–326.
SEFM-2012-LefticaruI #algorithm #approach #finite #generative #search-based #testing #using: An Improved Test Generation Approach from Extended Finite State Machines Using Genetic Algorithms (RL, FI), pp. 293–307.
ECMFA-2012-BriandLL #data flow #diagrams #integration #sequence #testing #uml: Combining UML Sequence and State Machine Diagrams for Data-Flow Based Integration Testing (LCB, YL, YL), pp. 74–89.
ECMFA-2012-HamannHG #monitoring #ocl #protocol #runtime: OCL-Based Runtime Monitoring of Applications with Protocol State Machines (LH, OH, MG), pp. 384–399.
ECMFA-2012-YueA #case study #industrial #non-functional #requirements #testing: Bridging the Gap between Requirements and Aspect State Machines to Support Non-functional Testing: Industrial Case Studies (TY, SA), pp. 133–145.
ECMFA-2012-Zhang #aspect-oriented #modelling #uml: Aspect-Oriented Modeling of Mutual Exclusion in UML State Machines (GZ), pp. 162–177.
ICMT-2012-Kosiuczenko: The Impact of Class Model Redesign on State Machines (PK), pp. 264–279.
SAC-2012-ScandurraAYD #case study #functional #modelling #requirements #validation: Functional requirements validation by transforming use case models into Abstract State Machines (PS, AA, TY, MD), pp. 1063–1068.
SAC-2012-ZurowskaD #execution #symbolic computation #uml: Symbolic execution of UML-RT State Machines (KZ, JD), pp. 1292–1299.
DATE-2012-NataleZ #finite #implementation: Task implementation of synchronous finite state machines (MDN, HZ), pp. 206–211.
ICST-2012-EndoS #comparison #finite #generative #testing: Experimental Comparison of Test Case Generation Methods for Finite State Machines (ATE, AdSS), pp. 549–558.
ICST-2012-PetrenkoSY #finite #generative #nondeterminism #sequence: Generating Checking Sequences for Nondeterministic Finite State Machines (AP, AdSS, NY), pp. 310–319.
ICTSS-2012-Vaandrager #finite #learning: Active Learning of Extended Finite State Machines (FWV), pp. 5–7.
CIAA-2011-KushikEY #adaptation #finite #nondeterminism: Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines (NK, KEF, NY), pp. 215–224.
IFL-2011-KoopmanAP #logic #modelling #testing: Model Based Testing with Logical Properties versus State Machines (PWMK, PA, RP), pp. 116–133.
AGTIVE-2011-StroblM #diagrams #editing #generative #graph transformation: Generating Graph Transformation Rules from AML/GT State Machine Diagrams for Building Animated Model Editors (TS, MM), pp. 65–80.
ICMT-J-2010-GronmoM11 #diagrams #graph transformation #sequence chart #uml: From UML 2 Sequence Diagrams to State Machines by Graph Transformation (RG, BMP), pp. 182–203.
ECMFA-2011-YueAB #automation #case study #testing #uml: Automated Transition from Use Cases to UML State Machines to Support State-Based Testing (TY, SA, LCB), pp. 115–131.
ESEC-FSE-2011-Hall #generative: Search based hierarchy generation for reverse engineered state machines (MH), pp. 392–395.
SAC-2011-KimDB #dependence #diagrams #identification #uml: Identifying properties of UML state machine diagrams that affect data and control dependence (HK, VD, DHB), pp. 1464–1469.
DATE-2011-SinhaP #representation #synthesis: Abstract state machines as an intermediate representation for high-level synthesis (RS, HDP), pp. 1406–1411.
ICSM-2010-PradelBG #evaluation #finite #framework #specification: A framework for the evaluation of specification miners based on finite state machines (MP, PB, TRG), pp. 1–10.
ICMT-2010-GronmoM #diagrams #graph transformation #sequence chart: From Sequence Diagrams to State Machines by Graph Transformation (RG, BMP), pp. 93–107.
MoDELS-v1-2010-RahimW #code generation #consistency #semantics #verification: Verifying Semantic Conformance of State Machine-to-Java Code Generators (LAR, JW), pp. 166–180.
ASE-2010-BalzSG #maintenance #modelling #tool support: Tool support for continuous maintenance of state machine models in program code (MB, MS, MG), pp. 175–176.
ASE-2010-HalleEBB #fault #model checking #navigation #runtime #web: Eliminating navigation errors in web applications via model checking and runtime enforcement of navigation state machines (SH, TE, CB, TB), pp. 235–244.
ICST-2010-Irfan #testing: State Machine Inference in Testing Context with Long Counterexamples (MNI), pp. 508–511.
ICST-2010-Weissleder #test coverage #uml: Simulated Satisfaction of Coverage Criteria on UML State Machines (SW), pp. 117–126.
QoSA-2009-BjornanderGL #architecture #simulation #specification: Timed Simulation of Extended AADL-Based Architecture Specifications with Timed Abstract State Machines (SB, LG, KL), pp. 101–115.
DocEng-2009-BattleB #behaviour #concurrent #documentation #modelling: Modelling composite document behaviour with concurrent hierarchical state machines (SB, HB), pp. 25–28.
FM-2009-SaidBS #refinement #tool support #uml: Language and Tool Support for Class and State Machine Refinement in UML-B (MYS, MJB, CFS), pp. 579–595.
SEFM-2009-SubramaniamGP #finite #impact analysis #testing #using: Using Change Impact Analysis to Select Tests for Extended Finite State Machines (MS, BG, ZP), pp. 93–102.
MoDELS-2009-DawV #modelling #process #uml: Deterministic UML Models for Interconnected Activities and State Machines (ZD, MV), pp. 556–570.
MoDELS-2009-Weissleder #industrial #modelling #testing #uml: Influencing Factors in Model-Based Testing with UML State Machines: Report on an Industrial Cooperation (SW), pp. 211–225.
MoDELS-2009-DawV #modelling #process #uml: Deterministic UML Models for Interconnected Activities and State Machines (ZD, MV), pp. 556–570.
MoDELS-2009-Weissleder #industrial #modelling #testing #uml: Influencing Factors in Model-Based Testing with UML State Machines: Report on an Industrial Cooperation (SW), pp. 211–225.
AdaEurope-2009-SaezTGC #ada #implementation #uml: Implementing Reactive Systems with UML State Machines and Ada 2005 (SS, ST, VLG, AC), pp. 149–163.
SAC-2009-ChoppyR #uml: A method for developing UML state machines (CC, GR), pp. 382–388.
FASE-2009-AndroutsopoulosCHLT #dependence #finite: Control Dependence for Extended Finite State Machines (KA, DC, MH, ZL, LT), pp. 216–230.
ICST-2009-BandyopadhyayG #generative #modelling #sequence #uml #using: Test Input Generation Using UML Sequence and State Machines Models (AB, SG), pp. 121–130.
ICST-2009-KalajiHS #finite #generative #testing: Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM) (ASK, RMH, SS), pp. 230–239.
TestCom-FATES-2009-El-FakihYF #fault #finite #testing: Testing Timed Finite State Machines with Guaranteed Fault Coverage (KEF, NY, HF), pp. 66–80.
WCRE-2008-AmalfitanoFT #finite #internet #reverse engineering: Reverse Engineering Finite State Machines from Rich Internet Applications (DA, ARF, PT), pp. 69–73.
SEFM-2008-GuoS #finite #impact analysis #proving #theorem proving #using: Formal Change Impact Analyses of Extended Finite State Machines Using a Theorem Prover (BG, MS), pp. 335–344.
AIIDE-2008-Schwab #game studies #implementation: Implementation Walkthrough of a Homegrown 'Abstract State Machine' Style System in a Commercial Sports Game (BS).
ICGT-2008-Striewe #graph grammar #implementation #using: Using a Triple Graph Grammar for State Machine Implementations (MS), pp. 514–516.
ICEIS-ISAS1-2008-LanoC #behaviour #refinement #semantics: Semantics and Refinement of Behavior State Machines (KL, DC), pp. 42–49.
ECMDA-FA-2008-Barbier #runtime #uml: Supporting the UML State Machine Diagramsat Runtime (FB), pp. 338–348.
ICMT-2008-AmstelBPV #algebra #modelling #process #question #semantic gap #uml: Transforming Process Algebra Models into UML State Machines: Bridging a Semantic Gap? (MvA, MvdB, ZP, TV), pp. 61–75.
MoDELS-2008-McIntoshHS #3d #diagrams #named #uml: X3D-UML: 3D UML State Machine Diagrams (PM, MH, RGvS), pp. 264–279.
MoDELS-2008-McIntoshHS #3d #diagrams #named #uml: X3D-UML: 3D UML State Machine Diagrams (PM, MH, RGvS), pp. 264–279.
ECOOP-2008-ChinM #interactive: An Extensible State Machine Pattern for Interactive Applications (BC, TDM), pp. 566–591.
AdaEurope-2008-AlonsoVPA #ada #modelling #thread #visual notation: StateML+s: From Graphical State Machine Models to Thread-Safe Ada Code (DA, CVC, JAP, BÁ), pp. 158–170.
POPL-2008-Chaudhuri #algorithm #recursion: Subcubic algorithms for recursive state machines (SC), pp. 159–169.
SAC-2008-LiQWLW #consistency #diagrams #interactive #java #runtime #source code #uml #verification: UML state machine diagram driven runtime verification of Java programs for message interaction consistency (XL, XQ, LW, BL, WEW), pp. 384–389.
OSDI-2008-MaoJM #named #performance: Mencius: Building Efficient Replicated State Machine for WANs (YM, FPJ, KM), pp. 369–384.
FASE-2008-BergJR #similarity #testing #using: Regular Inference for State Machines Using Domains with Equality Tests (TB, BJ, HR), pp. 317–331.
ICST-2008-El-FakihKPY #fault #finite: Extended Finite State Machine Based Test Derivation Driven by User Defined Faults (KEF, AK, SP, NY), pp. 308–317.
ICST-2008-LefticaruI #functional #search-based #testing: Functional Search-based Testing from State Machines (RL, FI), pp. 525–528.
TestCom-FATES-2008-SimaoP #finite #generative #sequence: Generating Checking Sequences for Partial Reduced Finite State Machines (AdSS, AP), pp. 153–168.
WCRE-2007-WalkinshawBHS #grammar inference #interactive #reverse engineering: Reverse Engineering State Machines by Interactive Grammar Inference (NW, KB, MH, SS), pp. 209–218.
ICALP-2007-TorreP #complexity #model checking #on the #recursion: On the Complexity of LtlModel-Checking of Recursive State Machines (SLT, GP), pp. 937–948.
LATA-2007-TorreNPP #verification: Verification of Succinct Hierarchical State Machines (SLT, MN, MP, GP), pp. 485–496.
GT-VMT-2007-KraemerH #collaboration #execution #specification: Transforming Collaborative Service Specifications into Efficiently Executable State Machines (FAK, PH).
SEKE-2007-XuXW #automation #code generation #protocol #uml: Automated Test Code Generation from UML Protocol State Machines (DX, WX, WEW), pp. 99–104.
MoDELS-2007-ZhangHK #aspect-oriented #uml: Enhancing UML State Machines with Aspects (GZ, MMH, AK), pp. 529–543.
MoDELS-2007-ZhangHK #aspect-oriented #uml: Enhancing UML State Machines with Aspects (GZ, MMH, AK), pp. 529–543.
TOOLS-EUROPE-2007-LanoC #semantics: Direct Semantics of Extended State Machines (KL, DC), pp. 35–51.
GTTSE-2007-JuhaszSP #c++ #finite #implementation #library: Implementation of a Finite State Machine with Active Libraries in C++ (ZJ, ÁS, ZP), pp. 474–488.
CASE-2007-GuoZW #automation #design #diagrams #flexibility #named: DiagramDraw: A State Machine Diagram Designer for Flexible Automation (WG, MZ, DW), pp. 352–356.
DAC-2007-PiyachonL #pattern matching #performance: Compact State Machines for High Performance Pattern Matching (PP, YL), pp. 493–496.
FASE-2007-HennickerK #synthesis: Activity-Driven Synthesis of State Machines (RH, AK), pp. 87–101.
A-MOST-2007-FarooqIMN #approach #testing: An approach for selective state machine based regression testing (QuaF, MZZI, ZIM, AN), pp. 44–52.
MBT-2007-OuimetL #automation #consistency #satisfiability #specification #using #verification: Automated Verification of Completeness and Consistency of Abstract State Machine Specifications using a SAT Solver (MO, KL), pp. 85–97.
TestCom-FATES-2007-PapSKN #algorithm #bound #finite #generative #incremental #testing: A Bounded Incremental Test Generation Algorithm for Finite State Machines (ZP, MS, GK, GÁN), pp. 244–259.
TestCom-FATES-2007-ShabaldinaEY #finite #nondeterminism #testing: Testing Nondeterministic Finite State Machines with Respect to the Separability Relation (NS, KEF, NY), pp. 305–318.
DLT-2006-GurevichW #question: Can Abstract State Machines Be Useful in Language Theory? (YG, CW), pp. 14–19.
RE-2006-WhittleJ #case study #generative: Generating Hierarchical State Machines from Use Case Charts (JW, PKJ), pp. 16–25.
FSE-2006-DamasLL #synthesis: Scenarios, goals, and state machines: a win-win partnership for model synthesis (CD, BL, AvL), pp. 197–207.
ICSE-2006-XieMY #automation: Automatic extraction of abstract-object-state machines from unit-test executions (TX, EM, HY), pp. 835–838.
SAC-2006-FekihAM #diagrams #specification #uml: Transformation of B specifications into UML class diagrams and state machines (HF, LJBA, SM), pp. 1840–1844.
DATE-DF-2006-HabibiMT #finite #generative: Generating finite state machines from SystemC (AH, HM, ST), pp. 76–81.
LCTES-2006-ProchnowTH: Synthesizing safe state machines from Esterel (SP, CT, RvH), pp. 113–124.
FASE-2006-BergJR #parametricity: Regular Inference for State Machines with Parameters (TB, BJ, HR), pp. 107–121.
TestCom-2006-Ipate #bound #finite #nondeterminism #sequence #testing: Bounded Sequence Testing from Non-deterministic Finite State Machines (FI), pp. 55–70.
TestCom-2006-KeumKKBC #finite #generative #testing #using #web #web service: Generating Test Cases for Web Services Using Extended Finite State Machine (CK, SK, IYK, JB, YIC), pp. 103–117.
VMCAI-2006-BozzelliTP #communication #recursion #verification: Verification of Well-Formed Communicating Recursive State Machines (LB, SLT, AP), pp. 412–426.
IFM-2005-SenguptaC #framework: An Integrated Framework for Scenarios and State Machines (BS, RC), pp. 366–385.
TACAS-2005-AlurCEM #detection #on the fly #reachability #recursion: On-the-Fly Reachability and Cycle Detection for Recursive State Machines (RA, SC, KE, PM), pp. 61–76.
TACAS-2005-EtessamiY #algorithm #probability #recursion #verification: Algorithmic Verification of Recursive Probabilistic State Machines (KE, MY), pp. 253–270.
CIAA-2004-DebskiF: Concatenation State Machines and Simple Functions (WD, WF), pp. 113–124.
ICEIS-v3-2004-McNeileS #behaviour #mixin #modelling: Mixin Based Behaviour Modelling — An Example Based on Composed State Machines (ATM, NS), pp. 179–183.
ICPR-v4-2004-ZhaiRS #detection #finite #using: Conversation Detection in Feature Films Using Finite State Machines (YZ, ZR, MS), pp. 458–461.
SAC-J-2003-BorgerCR04 #formal method #on the #uml #using: On formalizing UML state machines using ASM (EB, AC, ER), pp. 287–292.
DATE-v2-2004-TiwariT #embedded #finite #memory management: Saving Power by Mapping Finite-State Machines into Embedded Memory Blocks in FPGAs (AT, KAT), pp. 916–921.
TACAS-2004-BeauquierCP #automation #first-order #logic #parametricity #protocol #verification: Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic (DB, TC, EP), pp. 372–387.
CIAA-2003-KellyC #finite: Computational Linguistic Motivations for a Finite-State Machine Hierarchy (RK, JCB), pp. 301–303.
ICALP-2003-TorreNPP #recursion: Hierarchical and Recursive State Machines with Context-Dependent Properties (SLT, MN, MP, GP), pp. 776–789.
FME-2003-KuhnO: Interacting State Machines for Mobility (TAK, DvO), pp. 698–718.
SAC-2003-BorgerRC #concurrent #modelling #uml: Modeling the Meaning of Transitions from and to Concurrent States in UML State Machines (EB, ER, AC), pp. 1086–1091.
DATE-2003-LeeHH #composition #design #finite #power management: Decomposition of Extended Finite State Machine for Low Power Design (ML, TH, SYH), pp. 11152–11153.
TestCom-2003-El-FakihPYB #fault #finite: Fault Diagnosis in Extended Finite State Machines (KEF, SP, NY, GvB), pp. 197–210.
CAiSE-2002-MohanCS #approach #development #process: A State Machine Based Approach for a Process Driven Development of Web-Applications (RM, MAC, JS), pp. 52–66.
SEKE-2002-LeeKC #finite #interactive #sequence chart #testing: Construction of global finite state machine for testing task interactions written in message sequence charts (NHL, THK, SDC), pp. 369–376.
ICSE-2002-UchitelSZ #algorithm #modelling #tool support: Scenarios and state machines: models, algorithms, and tools (SU, TS, AZ), pp. 659–660.
DATE-2002-GorenF #finite #heuristic #named #reduction: CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines (SG, FJF), pp. 248–254.
DATE-2002-TeichK #configuration management #finite #implementation #self: (Self-)reconfigurable Finite State Machines: Theory and Implementation (JT, MK), pp. 559–566.
ISSTA-2002-FriedmanHNS #testing: Projected state machine coverage for software testing (GF, AH, KN, TS), pp. 134–143.
ISSTA-2002-GrieskampGSV #finite #generative: Generating finite state machines from abstract state machines (WG, YG, WS, MV), pp. 112–122.
TestCom-2002-SerdarT #approach #finite #generative #sequence: A New Approach To Checking Sequence Generation for Finite State Machines (BS, KCT), p. 391–?.
ICALP-2001-BenediktGR #model checking #strict: Model Checking of Unrestricted Hierarchical State Machines (MB, PG, TWR), pp. 652–666.
UML-2001-Kuske #graph transformation #semantics #uml: A Formal Semantics of UML State Machines Based on Structured Graph Transformation (SK), pp. 241–256.
AdaEurope-2001-Sanden #concurrent #design pattern #process: A Design Pattern for State Machines and Concurrent Activities (BS), pp. 203–214.
ASE-2001-ShenCH #tool support #uml #validation: A UML Validation Toolset Based on Abstract State Machines (WS, KJC, JH), pp. 315–318.
FASE-2001-BordeleauC #design #on the: On the Importance of Inter-scenario Relationships in Hierarchical State Machine Design (FB, JPC), pp. 156–170.
TACAS-2001-Castillo #analysis #modelling #tool support #validation: The ASM Workbench — A Tool Environment for Computer-Aided Analysis and Validation of Abstract State Machine Models Tool Demonstration (GDC), pp. 578–581.
CAV-2001-AlurEY #analysis #recursion: Analysis of Recursive State Machines (RA, KE, MY), pp. 207–220.
CAV-2001-Moore #execution #modelling #symbolic computation: Rewriting for Symbolic Execution of State Machine Models (JSM), pp. 411–422.
CSL-2001-StarkN #logic: A Logic for Abstract State Machines (RFS, SN), pp. 217–231.
LICS-2001-Gurevich: Logician in the Land of OS: Abstract State Machines in Microsoft (YG), pp. 129–136.
ICPR-v3-2000-HongHT #finite #gesture #performance #recognition: Constructing Finite State Machines for Fast Gesture Recognition (PH, TSH, MT), pp. 3695–3698.
UML-2000-Padawitz #constraints #diagrams #how #proving #theorem proving #uml: Swinging UML: How to Make Class Diagrams and State Machines Amenable to Constraint Solving and Proving (PP), pp. 162–177.
DAC-2000-HettSB #distance #finite #traversal: Distance driven finite state machine traversal (AH, CS, BB), pp. 39–42.
DATE-2000-Maurer #logic #network #simulation #using: Logic Simulation Using Networks of State Machines (PMM), pp. 674–678.
FASE-2000-ReggioACH #approach #formal method #lightweight #uml: Analysing UML Active Classes and Associated State Machines — A Lightweight Formal Approach (GR, EA, CC, HH), pp. 127–146.
CSL-2000-Schulte: Translating Theory into Practice — Abstract State Machines within Microsoft (WS), p. 71.
ICALP-1999-AlurKY #communication: Communicating Hierarchical State Machines (RA, SK, MY), pp. 169–178.
FM-v2-1999-GradelS: Logspace Reducibility via Abstract State Machines (EG, MS), pp. 1738–1757.
UML-1999-PaltorL #formal method #model checking #uml: Formalising UML State Machines for Model Checking (IP, JL), pp. 430–445.
TOOLS-EUROPE-1999-Madsen #integration #object-oriented #towards: Towards Integration of State Machines and Object-Oriented Languages (OLM), pp. 261–274.
DATE-1999-HongB #analysis #finite #reachability #scalability #using: Symbolic Reachability Analysis of Large Finite State Machines Using Don’t Cares (YH, PAB), p. 13–?.
DATE-1999-Sasaki #semantics #simulation: A Formal Semantics for Verilog-VHDL Simulation Interoperability by Abstact State Machine (HS), p. 353–?.
CAV-1999-Spielmann #automation #verification: Automatic Verification of Abstract State Machines (MS), pp. 431–442.
IWTCS-1999-YevtushenkoCA #embedded #finite #nondeterminism #testing: Test Suite Minimization for Embedded Nondeterministic Finite State Machines (NY, ARC, RA), pp. 237–250.
FM-1998-Borger #analysis #design #using: High Level System Design and Analysis Using Abstract State Machines (EB), pp. 1–43.
FM-1998-Castillo #architecture #tool support #towards: Towards Comprehensive Tool Support for Abstract State Machines: The ASM Workbench Tool Environment and Architecture (GDC), pp. 311–325.
FSE-1998-AlurY #model checking: Model Checking of Hierarchical State Machines (RA, MY), pp. 175–188.
DAC-1998-MonteiroO #composition #finite #power management: Finite State Machine Decomposition For Low Power (JCM, ALO), pp. 758–763.
IWTCS-1998-Boroday #finite #nondeterminism #testing: Distinguishing Tests for Nondeterministic Finite State Machines (SB), pp. 101–108.
WPC-1997-KloschWTs #component #comprehension: Facilitating Program Comprehension via Generic Components for State Machines (RK, JW, GT, HCG), pp. 118–127.
WIA-1997-GarzonGRMDFS #finite #implementation: In Vitro Implementation of Finite-State Machines (MHG, YG, JAR, RCM, RJD, DRF, SESJ), pp. 56–74.
ESEC-FSE-1997-HeimdahlW #reduction #slicing: Reduction and Slicing of Hierarchical State Machines (MPEH, MWW), pp. 450–467.
DAC-1997-MarculescuMP #analysis #finite #probability #sequence: Sequence Compaction for Probabilistic Analysis of Finite-State Machines (DM, RM, MP), pp. 12–15.
EDTC-1997-PomeranzR97a #finite #on the #testing: On the use of reset to increase the testability of interconnected finite-state machines (IP, SMR), pp. 554–559.
CADE-1997-EastaughffeOC #formal method #proving #visual notation: Proof Tactics for a Theory of State Machines in a Graphical Environment (KAE, MAO, AC), pp. 366–379.
TRI-Ada-1996-Sanden: The State-Machine Pattern (BS), pp. 135–142.
DAC-1996-HiguchiM #algorithm #finite #performance #reduction: A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines (HH, YM), pp. 463–466.
OOPSLA-1995-SaneC #composition #object-oriented #subclass: Object-Oriented State Machines: Subclassing, Composition, Delegation and Genericity (AS, RHC), pp. 17–32.
CAV-1995-AzizBBDS #finite: Supervisory Control of Finite State Machines (AA, FB, RKB, MDD, AS), pp. 279–292.
DAC-1994-AzizTB #finite: BDD Variable Ordering for Interacting Finite State Machines (AA, ST, RKB), pp. 283–288.
DAC-1994-DagaB #composition #interface: The Minimization and Decomposition of Interface State Machines (AJD, WPB), pp. 120–125.
DAC-1994-HachtelMPS #analysis #finite #probability #scalability: Probabilistic Analysis of Large Finite State Machines (GDH, EM, AP, FS), pp. 270–275.
DAC-1994-LamBS #finite: Exact Minimum Cycle Times for Finite State Machines (WKCL, RKB, ALSV), pp. 100–105.
EDAC-1994-Damiani #finite #nondeterminism: Nondeterministic finite-state machines and sequential don’t cares (MD), pp. 192–198.
EDAC-1994-HachtelMPS #algorithm #finite: Symbolic Algorithms to Calculate Steady-State Probabilities of a Finite State Machine (GDH, EM, AP, FS), pp. 214–218.
HPDC-1994-Benslimane #bound #communication #finite: Deciding Boundedness for Systems of Two Communicating Finite State Machines (AB), pp. 262–269.
ICALP-1993-CohenF #finite: Products of Finite State Machines with Full Coverage (DMC, MLF), pp. 469–477.
SEKE-1993-DingK #behaviour #specification: Attributed State Machines For Behavior Specification of Reactive Systems (SD, TK), pp. 695–702.
DAC-1993-ChengK #automation #finite #functional #generative #testing #using: Automatic Functional Test Generation Using the Extended Finite State Machine Model (KTC, ASK), pp. 86–91.
DAC-1993-ChuML #finite #performance: An Efficient Critical Race-Free State Assignment Technique for Asynchronous Finite State Machines (TAC, NM, CKCL), pp. 2–6.
DAC-1993-RhoSP #finite #sequence: Minimum Length Synchronizing Sequences of Finite State Machine (JKR, FS, CP), pp. 463–468.
CAV-1993-Krishnakumar #composition #finite #reachability: Reachability and Recurrence in Extended Finite State Machines: Modular Vector Addition Systems (ASK), pp. 110–122.
IWPTS-1993-LuoDBVG #distributed #finite #generative #sequence #testing: Generating Synchronizable Test Sequences Based on Finite State Machine with Distributed Ports (GL, RD, GvB, PV, AG), pp. 139–153.
IWPTS-1993-PetrenkoYLD #consistency #nondeterminism #protocol #testing: Nondeterministic State Machines in Protocol Conformance Testing (AP, NY, AL, AD), pp. 363–378.
DAC-1992-ChakradharKA #fault tolerance #finite #synthesis: Finite State Machine Synthesis with Fault Tolerant Test Function (STC, SK, VDA), pp. 562–567.
CAV-1992-HiguchiSSFK #communication #finite #invariant #verification: A Verification Procedure via Invariant for Extended Communicating Finite-State Machines (MH, OS, HS, MF, TK), pp. 384–395.
IWPTS-1992-GhedamsiDB #fault #finite #nondeterminism #testing: Diagnostic Tests for Single Transition Faults in Non-Deterministic Finite State Machines (AG, RD, GvB), pp. 105–116.
IWPTS-1992-Kloosterman #finite #nondeterminism: Test Derivation from Non-Deterministic Finite State Machines (HK), pp. 297–308.
DAC-1991-EschermannW #approach #finite #self #synthesis: A Unified Approach for the Synthesis of Self-Testable Finite State Machines (BE, HJW), pp. 372–377.
DAC-1991-LaddB #finite #multi #synthesis: Synthesis of Multiple-Input Change Asynchronous Finite state Machines (ML, WPB), pp. 309–314.
STOC-1991-YannakakisL #finite #testing: Testing Finite State Machines (MY, DL), pp. 476–485.
CAV-1991-LangevinC: Comparing Generic State Machines (ML, EC), pp. 466–476.
CAV-1991-MaoM #automation #equivalence #finite #proving: An Automated Proof Technique for Finite-State Machine Equivalence (WM, GJM), pp. 233–243.
IWPTS-1991-FujiwaraB #fault #nondeterminism #testing: Testing Non-Deterministic State Machines with Fault Coverage (SF, GvB), pp. 267–280.
CAV-1990-PengP #approach #communication #concurrent #detection #finite #network #problem: A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines (WP, SP), pp. 243–252.
DAC-1989-Paulin #clustering #finite: Horizontal Partitioning of PLA-based Finite State Machines (PGP), pp. 333–338.
DAC-1989-VillaS #finite #implementation #logic #named: NOVA: State Assignment of Finite State Machines for Optimal Two-level Logic Implementations (TV, ALSV), pp. 327–332.
DAC-1987-Kingsley #compilation #implementation: The Implementation of a State Machine Compiler (CK), pp. 580–583.
ICALP-1984-GoudaR #communication #finite: Communicating Finite State Machines with Priority Channels (MGG, LER), pp. 209–221.
DAC-1981-Brown: A State-Machine Synthesizer — SMS (DWB), pp. 301–305.