BibSLEIGH — state stem

Used together with:

machin (218)
finit (198)
model (171)
base (150)
system (147)

Stem state$ (all stems)

1188 papers:

CASE-2015-BergagardF #automation #on the #using: On restart of automated manufacturing systems using restart states (PB, MF), pp. 166–167.
CASE-2015-FeiAR #bound #clustering #resource management #symbolic computation #using: Symbolic computation of boundary unsafe states in complex resource allocation systems using partitioning techniques (ZF, KÅ, SAR), pp. 799–806.
CASE-2015-LinZW #predict #realtime #using: Using real-time sensing data for predicting future state of building fires (CCL, GZ, LLW), pp. 1313–1318.
CASE-2015-LuoZHZ #modelling #synthesis: Discrete-event controller synthesis based on state space models (JL, QZ, YSH, MZ), pp. 87–92.
DAC-2015-CuiWCZNP #energy #grid #smarttech: Optimal control of PEVs for energy cost minimization and frequency regulation in the smart grid accounting for battery state-of-health degradation (TC, YW, SC, QZ, SN, MP), p. 6.
DAC-2015-HerdtLD #simulation #using #verification: Verifying SystemC using stateful symbolic simulation (VH, HML, RD), p. 6.
DATE-2015-BerryhillV #automation #functional: Automated rectification methodologies to functional state-space unreachability (RB, AGV), pp. 1401–1406.
VLDB-2015-LiWDD #framework #named: UDA-GIST: An In-database Framework to Unify Data-Parallel and State-Parallel Analytics (KL, DZW, AD, CD), pp. 557–568.
ITiCSE-2015-BoshartK #object-oriented: Delegate, Decorate, State, and Illustrate in the OOP Course (MAB, MJK), p. 339.
ESOP-2015-CoxCR #abstraction #multi #source code: Desynchronized Multi-State Abstractions for Open Programs in Dynamic Languages (AC, BYEC, XR), pp. 483–509.
FASE-2015-KnappMRG #state machine #uml: An Institution for Simple UML State Machines (AK, TM, MR, MG), pp. 3–18.
FoSSaCS-2015-JacobsWW #set: States of Convex Sets (BJ, BW, BW), pp. 87–101.
TACAS-2015-CookKP #infinity: Fairness for Infinite-State Systems (BC, HK, NP), pp. 384–398.
ICPC-2015-SunshineHA #api #protocol #usability: Searching the state space: a qualitative study of API protocol usability (JS, JDH, JA), pp. 82–93.
ICSME-2015-BiegelLD #behaviour #java: Live object exploration: Observing and manipulating behavior and state of Java objects (BB, BL, SD), pp. 581–585.
PLDI-2015-DeligiannisDKLT #analysis #programming #state machine #testing: Asynchronous programming, analysis and testing with state machines (PD, AFD, JK, AL, PT), pp. 154–164.
CIAA-J-2013-BalkanskiBKW15 #complexity #on the #word: On the state complexity of partial word DFAs (EB, FBS, MK, BJW), pp. 2–12.
CIAA-2015-KushikY #automaton #finite #nondeterminism #sequence #state machine: Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (NK, NY), pp. 188–198.
CIAA-2015-NgRS #complexity #distance: State Complexity of Prefix Distance (TN, DR, KS), pp. 238–249.
DLT-2015-KlimannPS #automaton #infinity: A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group (IK, MP, DS), pp. 313–325.
DLT-2015-NgRS #approximate #complexity #pattern matching: State Complexity of Neighbourhoods and Approximate Pattern Matching (TN, DR, KS), pp. 389–400.
ICALP-v1-2015-GharibianS: Ground State Connectivity of Local Hamiltonians (SG, JS), pp. 617–628.
ICALP-v2-2015-BouajjaniEEH #on the #reachability: On Reducing Linearizability to State Reachability (AB, ME, CE, JH), pp. 95–107.
CHI-2015-BorstTR #problem #what: What Makes Interruptions Disruptive?: A Process-Model Account of the Effects of the Problem State Bottleneck on Task Interruption and Resumption (JPB, NAT, HvR), pp. 2971–2980.
CHI-2015-Tajadura-Jimenez: As Light as your Footsteps: Altering Walking Sounds to Change Perceived Body Weight, Emotional State and Gait (ATJ, MB, OD, MF, NM, NBB), pp. 2943–2952.
DUXU-IXD-2015-Moldenhauer #design #how #student: How Do I Get to Room 3106? — Student Wayfinding Designs for Old Main at Wayne State University (JAM), pp. 390–399.
HIMI-IKC-2015-KimitaMMNIS #education #learning: Learning State Model for Value Co-Creative Education Services (KK, KM, SM, YN, TI, YS), pp. 341–349.
HIMI-IKD-2015-IwamotoH #induction #using: Induction of a Relaxed State Using a Vibration Stimulus Based on the Respiratory Cycle (NI, HH), pp. 386–395.
LCT-2015-HayashiM #design #online: Designing Pedagogical Agents to Evoke Emotional States in Online Tutoring Investigating the Influence of Animated Characters (YH, DMM), pp. 372–383.
SCSM-2015-GerritsenB #analysis #predict: Simulation-Based Prediction and Analysis of Collective Emotional States (CG, WRJvB), pp. 118–126.
ECIR-2015-LuoZDY #design #using: Designing States, Actions, and Rewards for Using POMDP in Session Search (JL, SZ, XD, HY), pp. 526–537.
ICML-2015-WeissN #alias #learning: Learning Parametric-Output HMMs with Two Aliased States (RW, BN), pp. 635–644.
KDD-2015-BarajasA #approach #health #modelling: Dynamically Modeling Patient’s Health State from Electronic Medical Records: A Time Series Approach (KLCB, RA), pp. 69–78.
KDD-2015-NikolaevDGUGS #composition #evaluation #online: Extreme States Distribution Decomposition Method for Search Engine Online Evaluation (KN, AD, EG, AU, GG, PS), pp. 845–854.
KDD-2015-QiATSA #predict: State-Driven Dynamic Sensor Selection and Prediction with State-Stacked Sparseness (GJQ, CA, DST, DMS, PA), pp. 945–954.
KDD-2015-StantonTJVCS #data-driven #mining: Mining for Causal Relationships: A Data-Driven Study of the Islamic State (AS, AT, AJ, PV, AC, PS), pp. 2137–2146.
MoDELS-2015-DasD #state machine #uml: State machine antipatterns for UML-RT (TKD, JD), pp. 54–63.
MoDELS-2015-KhalilD #evolution #execution #incremental #state machine #symbolic computation: Incremental symbolic execution of evolving state machines (AK, JD), pp. 14–23.
ECOOP-2015-BurckhardtLPF #abstraction #protocol #robust #sequence: Global Sequence Protocol: A Robust Abstraction for Replicated Shared State (SB, DL, JP, MF), pp. 568–590.
PADL-2015-BassedaK #logic #transaction #using: State Space Planning Using Transaction Logic (RB, MK), pp. 17–33.
POPL-2015-ChatterjeeIPG #algebra #algorithm #constant #performance #recursion #state machine: Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth (KC, RIJ, AP, PG), pp. 97–109.
SAC-2015-BourdilBDV #petri net #symmetry: Symmetry reduced state classes for time petri nets (PAB, BB, SDZ, FV), pp. 1751–1758.
SAC-2015-Jung0B #analysis #embedded #encoding #identification #power management: Identification of embedded control units by state encoding and power consumption analysis (EJ, CM, LB), pp. 1957–1959.
SAC-2015-XiongN #estimation #low cost #power management: Cost-efficient and attack-resilient approaches for state estimation in power grids (KX, PN), pp. 2192–2197.
ESEC-FSE-2015-XiongH0ZZL: Inner oracles: input-specific assertions on internal states (YX, DH, LZ, TZ, MZ, TL), pp. 902–905.
ICSE-v2-2015-Franch #requirements #state of the art: Software Requirements Patterns — A State of the Art and the Practice (XF), pp. 943–944.
HPDC-2015-PokeH #named #network #replication #state machine: DARE: High-Performance State Machine Replication on RDMA Networks (MP, TH), pp. 107–118.
PPoPP-2015-ChangG #algorithm #concurrent #parallel: A parallel algorithm for global states enumeration in concurrent systems (YJC, VKG), pp. 140–149.
CAV-2015-CookKP #automation #infinity #on the #verification: On Automation of CTL* Verification for Infinite-State Systems (BC, HK, NP), pp. 13–29.
ISSTA-2015-GyoriSHM #dependence #detection #reliability #testing: Reliable testing: detecting state-polluting tests to prevent test dependency (AG, AS, FH, DM), pp. 223–233.
LICS-2015-BlondinFGHM #2d #reachability: Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (MB, AF, SG, CH, PM), pp. 32–43.
LICS-2015-MaillardM: A Fibrational Account of Local States (KM, PAM), pp. 402–413.
VMCAI-2015-BackesR #abstraction #analysis #clustering #graph transformation #infinity: Analysis of Infinite-State Graph Transformation Systems by Cluster Abstraction (PB, JR), pp. 135–152.
WICSA-2014-CostaPDM #architecture #question #rest #what: Evaluating a Representational State Transfer (REST) Architecture: What is the Impact of REST in My Architecture? (BC, PFP, FCD, PM), pp. 105–114.
ASE-2014-LiC #runtime #validation: Symbolic state validation through runtime data (YL, SCC), pp. 187–198.
CASE-2014-HsuehTLKY #estimation: Voltage-current-based state and disturbance estimation for power-assisted control applied to an electric wheelchair (PWH, MCT, CYL, PJK, WSY), pp. 1220–1225.
DAC-2014-OetjensBBBBCCDEGKKLM0MPPRRRSSTV #challenge #evaluation #prototype #research #safety #state of the art #using: Safety Evaluation of Automotive Electronics Using Virtual Prototypes: State of the Art and Research Challenges (JHO, NB, MB, OB, AB, MC, SC, RD, WE, KG, TK, CK, HML, MM, WM, DMG, FP, HP, SR, WR, SR, US, AvS, BAT, AV), p. 6.
DAC-2014-WenZMC #design #memory management #strict: State-Restrict MLC STT-RAM Designs for High-Reliable High-Performance Memory System (WW, YZ, MM, YC), p. 6.
DATE-2014-WangLLW0 #design #functional #generative #testing: Functional test generation guided by steady-state probabilities of abstract design (JW, HL, TL, TW, XL), pp. 1–4.
DATE-2014-WangLXCP #energy #hybrid: Minimizing state-of-health degradation in hybrid electrical energy storage systems with arbitrary source and load profiles (YW, XL, QX, NC, MP), pp. 1–4.
DATE-2014-YangMPOP #logic #using: Complementary resistive switch based stateful logic operations using material implication (YY, JM, DKP, MO, SP), pp. 1–4.
DATE-2014-ZuoloZMGICPOB #design #fine-grained #framework #named: SSDExplorer: A virtual platform for fine-grained design space exploration of Solid State Drives (LZ, CZ, RM, SG, MI, SDC, PP, PO, DB), pp. 1–6.
ITiCSE-2014-BerryK #game studies #learning #programming: The state of play: a notional machine for learning programming (MB, MK), pp. 21–26.
ESOP-2014-NanevskiLSD #communication #concurrent #fine-grained: Communicating State Transition Systems for Fine-Grained Concurrent Resources (AN, RLW, IS, GAD), pp. 290–310.
TACAS-2014-WijsB #manycore #named #on the fly #using: GPUexplore: Many-Core On-the-Fly State Space Exploration Using GPUs (AW, DB), pp. 233–247.
WRLA-2014-BaeM #infinity #model checking #using: Infinite-State Model Checking of LTLR Formulas Using Narrowing (KB, JM), pp. 113–129.
CSMR-WCRE-2014-PerscheidFH #debugging #execution: Follow the path: Debugging state anomalies along execution histories (MP, TF, RH), pp. 124–133.
ICPC-2014-MatsumuraIKI #execution #java #performance #visualisation: Repeatedly-executed-method viewer for efficient visualization of execution paths and states in Java (TM, TI, YK, KI), pp. 253–257.
ICSME-2014-KhanIA #approach #behaviour #heuristic #state machine #uml: A Heuristic-Based Approach to Refactor Crosscutting Behaviors in UML State Machines (MUK, MZI, SA), pp. 557–560.
AFL-2014-CevorovaJMPS #automaton: Operations on Automata with All States Final (KC, GJ, PM, MP, JS), pp. 201–215.
CIAA-2014-BianchiMP #automaton #on the #power of #quantum: On the Power of One-Way Automata with Quantum and Classical States (MPB, CM, BP), pp. 84–97.
CIAA-2014-KurkaV #finite #transducer: Analytic Functions Computable by Finite State Transducers (PK, TV), pp. 252–263.
DLT-2014-FeliceN #algorithm #automaton #complexity #on the: On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States (SDF, CN), pp. 25–36.
DLT-2014-HanKS #complexity: State Complexity of Deletion (YSH, SKK, KS), pp. 37–48.
ICALP-v2-2014-EmekLUW #finite #problem #state machine: Solving the ANTS Problem with Asynchronous Finite State Machines (YE, TL, JU, RW), pp. 471–482.
LATA-2014-BestD #bound #graph #petri net: Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets (EB, RRD), pp. 161–172.
LATA-2014-FelgenhauerT #analysis #automaton #reachability: Reachability Analysis with State-Compatible Automata (BF, RT), pp. 347–359.
LATA-2014-ZhengGQ #automaton #complexity #finite #on the: On the State Complexity of Semi-quantum Finite Automata (SZ, JG, DQ), pp. 601–612.
FM-2014-RinastSG #graph #performance #reduction: A Graph-Based Transformation Reduction to Reach UPPAAL States Faster (JR, SS, DG), pp. 547–562.
IFM-2014-OliveiraSF #model checking #specification: Model-Checking Circus State-Rich Specifications (MVMO, ACAS, MSCF), pp. 39–54.
IFM-2014-RamsdellDGR #analysis #hybrid #protocol #security: A Hybrid Analysis for Security Protocols with State (JDR, DJD, JDG, PDR), pp. 272–287.
SEFM-2014-CasselHJS #finite #learning #state machine: Learning Extended Finite State Machines (SC, FH, BJ, BS), pp. 250–264.
SEFM-2014-RodriguezFHM #erlang #execution #state machine #uml #verification: Execution and Verification of UML State Machines with Erlang (RJR, LÅF, ÁHN, JM), pp. 284–289.
IFL-2014-LeF #functional #parallel: Combining Shared State with Speculative Parallelism in a Functional Language (ML, MF), p. 2.
GRAPHITE-2014-SenniS #knowledge base #reduction: Backwards State-space Reduction for Planning in Dynamic Knowledge Bases (VS, MS), pp. 84–99.
CHI-2014-DixonLF #implementation #runtime: Pixel-based methods for widget state and style in a runtime implementation of sliding widgets (MED, GL, JAF), pp. 2231–2240.
CHI-2014-McLachlanBB #interactive: Transient and transitional states: pressure as an auxiliary input modality for bimanual interaction (RM, DB, SAB), pp. 401–410.
CSCW-2014-YueHH #collaboration #modelling #process #using #web: Modeling search processes using hidden states in collaborative exploratory web search (ZY, SH, DH), pp. 820–830.
DHM-2014-Delgado-GonzaloRCSLBL #algorithm #embedded #energy #modelling #state of the art: Human Energy Expenditure Models: Beyond State-of-the-Art Commercialized Embedded Algorithms (RDG, PR, EMC, JS, CL, MB, ML), pp. 3–14.
HIMI-AS-2014-CaldwellV #interface: Improving Control Room State Awareness through Complex Sonification Interfaces (BSC, JEV), pp. 317–323.
HIMI-AS-2014-MatsuiHKA #behaviour #case study #education #learning: A Study on Exploration of Relationships between Behaviors and Mental States of Learners for Value Co-creative Education and Learning Environment (TM, YH, KK, TA), pp. 69–79.
HIMI-AS-2014-Sakurai #education: The Value Improvement in Education Service by Grasping the Value Acceptance State with ICT Utilized Education Environment (YS), pp. 90–98.
VISSOFT-2014-RozenbergB #visualisation: Templated Visualization of Object State with Vebugger (DR, IB), pp. 107–111.
EDOC-2014-KurodaG #dependence #modelling #scalability: Model-Based IT Change Management for Large System Definitions with State-Related Dependencies (TK, ASG), pp. 170–179.
ICEIS-v2-2014-Hauer #state of the art: Data Leakage Prevention — A Position to State-of-the-Art Capabilities and Remaining Risk (BH), pp. 361–367.
ICEIS-v3-2014-WissotzkiTWK #bibliography #perspective #state of the art: Investigation of IT Sourcing, Relationship Management and Contractual Governance Approaches — State of the Art Literature Review (MW, FT, JW, HK), pp. 280–287.
ICML-c2-2014-TaylorGP #analysis #approximate #linear #programming: An Analysis of State-Relevance Weights and Sampling Distributions on L1-Regularized Approximate Linear Programming Approximation Accuracy (GT, CG, DP), pp. 451–459.
ICPR-2014-AlemdarKNME #behaviour #modelling #using: A Unified Model for Human Behavior Modeling Using a Hierarchy with a Variable Number of States (HÖA, TvK, MEN, AM, CE), pp. 3804–3809.
ICPR-2014-LinCCLH #analysis #detection: Left-Luggage Detection from Finite-State-Machine Analysis in Static-Camera Videos (KL, SCC, CSC, DTL, YPH), pp. 4600–4605.
KDD-2014-GhassemiNDBJRS #modelling: Unfolding physiological state: mortality modelling in intensive care units (MG, TN, FDV, NB, RJ, AR, PS), pp. 75–84.
KDD-2014-KateCPK #mining #named #safety: FoodSIS: a text mining system to improve the state of food safety in singapore (KK, SC, AP, JK), pp. 1709–1718.
KDIR-2014-KurasEAH #data mining #mining #security: The GDR Through the Eyes of the Stasi — Data Mining on the Secret Reports of the State Security Service of the former German Democratic Republic (CK, TE, CA, GH), pp. 360–365.
KDIR-2014-PlansangketG #evaluation #performance #query #retrieval #state of the art: Performance Evaluation of State-of-the-Art Ranked Retrieval Methods and Their Combinations for Query Suggestion (SP, JQG), pp. 141–148.
KEOD-2014-Bergamaschi #big data #challenge #integration #state of the art: Big Data Integration — State of the Art & Challenges (SB), pp. 1–7.
KEOD-2014-LeinweberFSL #bibliography #enterprise #ontology #perspective #research #roadmap: Enterprise Ontologies: Open Issues and the State of Research — A Systematic Literature Review (AL, MF, PS, BL), pp. 280–287.
KR-2014-HaririCD #bound: State-Boundedness in Data-Aware Dynamic Systems (BBH, DC, MM, AD).
MLDM-2014-JiangDPL #approach #estimation #markov #optimisation #recognition: Modified Bootstrap Approach with State Number Optimization for Hidden Markov Model Estimation in Small-Size Printed Arabic Text Line Recognition (ZJ, XD, LP, CL), pp. 437–441.
AMT-2014-ZhangBBEHKW #code generation #concurrent #java #state machine #towards: Towards Verified Java Code Generation from Concurrent State Machines (DZ, DB, MvdB, LE, CH, RK, AW), pp. 64–69.
BX-2014-CheneyMSGA #monad: Entangled State Monads (JC, JM, PS, JG, FAS), pp. 108–111.
MoDELS-2014-LiebelMTLH #embedded #modelling: Assessing the State-of-Practice of Model-Based Engineering in the Embedded Systems Domain (GL, NM, MT, AL, JH), pp. 166–182.
MoDELS-2014-Pazzi #behaviour #composition #modelling: Modeling Systemic Behavior by State-Based Holonic Modular Units (LP), pp. 99–115.
MoDELS-2014-LiebelMTLH #embedded #modelling: Assessing the State-of-Practice of Model-Based Engineering in the Embedded Systems Domain (GL, NM, MT, AL, JH), pp. 166–182.
MoDELS-2014-Pazzi #behaviour #composition #modelling: Modeling Systemic Behavior by State-Based Holonic Modular Units (LP), pp. 99–115.
ECOOP-2014-SunshineHA #documentation #empirical #programming #protocol: Structuring Documentation to Support State Search: A Laboratory Experiment about Protocol Programming (JS, JDH, JA), pp. 157–181.
ECOOP-2014-WeiR #analysis #behaviour #javascript #points-to: State-Sensitive Points-to Analysis for the Dynamic Behavior of JavaScript Objects (SW, BGR), pp. 1–26.
Onward-2014-LorenzR #version control: Versionable, Branchable, and Mergeable Application State (DHL, BR), pp. 29–42.
PPDP-2014-JansenDDJ #evaluation #state of the art: Experimental Evaluation of a State-Of-The-Art Grounder (JJ, ID, JD, GJ), pp. 249–258.
PPDP-2014-Karczmarczuk #concept #declarative #on the #quantum #tutorial: On the Declarative Structure of Quantum Concepts: States and Observables (Distilled Tutorial) (JK), pp. 105–110.
REFSQ-2014-AbeleinP #communication #developer #scalability: State of Practice of User-Developer Communication in Large-Scale IT Projects — Results of an Expert Interview Series (UA, BP), pp. 95–111.
SAC-2014-LiuGSLSX #communication #encryption #grid #named #smarttech: SEDE: state estimation-based dynamic encryption scheme for smart grid communication (TL, YG, YS, YL, YS, FX), pp. 539–544.
FSE-2014-VakiliD #infinity #modelling #smt #using #verification: Verifying CTL-live properties of infinite state models using an SMT solver (AV, NAD), pp. 213–223.
SLE-2014-KaufmannKPSW #debugging #diagrams #satisfiability #sequence chart #state machine: A SAT-Based Debugging Tool for State Machines and Sequence Diagrams (PK, MK, AP, MS, MW), pp. 21–40.
ASPLOS-2014-MytkowiczMS #finite #state machine: Data-parallel finite-state machines (TM, MM, WS), pp. 529–542.
ASPLOS-2014-ZhaoWS #finite #state machine: Challenging the “embarrassingly sequential”: parallelizing finite state machine-based computations through principled speculation (ZZ, BW, XS), pp. 543–558.
HPCA-2014-JungK #named #resource management: Sprinkler: Maximizing resource utilization in many-chip solid state disks (MJ, MTK), pp. 524–535.
HPDC-2014-MuCWZ #network #replication #state machine: 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 #state machine: CASM: optimized compilation of abstract state machines (RL, PP, AK), pp. 13–22.
ISSTA-2014-JustEF #analysis #clustering #execution #mutation testing #performance: Efficient mutation analysis by propagating and partitioning infected execution states (RJ, MDE, GF), pp. 315–326.
ISSTA-2014-ZhangW #concurrent #parallel #runtime #thread: Runtime prevention of concurrency related type-state violations in multithreaded applications (LZ, CW), pp. 1–12.
LICS-CSL-2014-AbdullaAHMKT #energy #game studies #infinity: Infinite-state energy games (PAA, MFA, PH, RM, KNK, PT), p. 10.
RTA-TLCA-2014-Mellies #diagrams #string: Local States in String Diagrams (PAM), pp. 334–348.
TAP-2014-KahkonenH #automation #lightweight #parallel #source code #testing #thread: Lightweight State Capturing for Automated Testing of Multithreaded Programs (KK, KH), pp. 187–203.
VMCAI-2014-WangH #concurrent #reachability: Precisely Deciding Control State Reachability in Concurrent Traces with Limited Observability (CW, KH), pp. 376–394.
ASE-2013-CotroneoLFN #named #operating system #robust #testing: SABRINE: State-based robustness testing of operating systems (DC, DDL, FF, RN), pp. 125–135.
ASE-2013-Xiao0LLS #learning #named #type system: TzuYu: Learning stateful typestates (HX, JS, YL, SWL, CS), pp. 432–442.
CASE-2013-MohajeraniMF #automaton #composition #finite #using #verification: Compositional nonblocking verification for extended finite-state automata using partial unfolding (SM, RM, MF), pp. 930–935.
CASE-2013-SaricXS #assembly: Robotic surface assembly via contact state transitions (AS, JX, JS), pp. 954–959.
DAC-2013-LiuCHVNBP #design #energy #logic #physics: Minimum-energy state guided physical design for nanomagnet logic (SL, GC, XSH, EV, MTN, GHB, WP), p. 7.
DAC-2013-RaiSST #algorithm #analysis #distributed #network #process: Distributed stable states for process networks: algorithm, analysis, and experiments on intel SCC (DR, LS, NS, LT), p. 10.
DATE-2013-BackesR #reachability #using: Using cubes of non-state variables with property directed reachability (JDB, MDR), pp. 807–810.
DATE-2013-HanCL #compilation: Compiling control-intensive loops for CGRAs with state-based full predication (KH, KC, JL), pp. 1579–1582.
DATE-2013-HasanA #analysis #fault #feedback #formal method #using: Formal analysis of steady state errors in feedback control systems using HOL-light (OH, MA), pp. 1423–1426.
DATE-2013-ZhuDNZ #finite #implementation #robust #state machine: Robust and extensible task implementations of synchronous finite state machines (QZ, PD, MDN, HZ), pp. 1319–1324.
ICDAR-2013-HaoGZXPSK #automation #detection #fault #finite #transducer: Automated Error Detection and Correction of Chinese Characters in Written Essays Based on Weighted Finite-State Transducer (SH, ZG, MZ, YX, HP, KS, DK), pp. 763–767.
SIGMOD-2013-FernandezMKP #fault tolerance #using: Integrating scale out and fault tolerance in stream processing using operator state management (RCF, MM, EK, PP), pp. 725–736.
SIGMOD-2013-GeorgiadisKGPTM #algorithm #data type #detection #framework #state of the art: Continuous outlier detection in data streams: an extensible framework and state-of-the-art algorithms (DG, MK, AG, ANP, KT, YM), pp. 1061–1064.
FASE-2013-BeyerL #model checking: Explicit-State Software Model Checking Based on CEGAR and Interpolation (DB, SL), pp. 146–162.
FASE-2013-Czarnecki #state of the art #variability: Variability in Software: State of the Art and Future Directions — (Extended Abstract) (KC), pp. 1–5.
TACAS-2013-Wendler #analysis #contest: CPAchecker with Sequential Combination of Explicit-State Analysis and Predicate Analysis — (Competition Contribution) (PW), pp. 613–615.
SCAM-2013-WangFGN #debugging #interactive: A state alteration and inspection-based interactive debugger (YW, MF, RG, IN), pp. 84–93.
WCRE-2013-ClearyGVSSP #analysis #interactive #memory management #multi: Reconstructing program memory state from multi-gigabyte instruction traces to support interactive analysis (BC, PG, EV, MADS, MS, FP), pp. 42–51.
WCRE-2013-WalkinshawTD #finite #modelling #state machine: Inferring Extended Finite State Machine models from software executions (NW, RT, JD), pp. 301–310.
STOC-2013-BrandaoH13a #approximate #quantum: Product-state approximations to quantum ground states (FGSLB, AWH), pp. 871–880.
DLT-J-2012-HromkovicKKS13 #automaton #logic #nondeterminism #representation: Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ (JH, RK, RK, RS), pp. 955–978.
CIAA-2013-BrzozowskiL #complexity: Universal Witnesses for State Complexity of Basic Operations Combined with Reversal (JAB, DL), pp. 72–83.
CIAA-2013-HanKS #approximate #automaton #context-free grammar #finite: Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (YSH, SKK, KS), pp. 146–157.
CIAA-2013-KushikY #finite #nondeterminism #on the #sequence #state machine: On the Length of Homing Sequences for Nondeterministic Finite State Machines (NK, NY), pp. 220–231.
DLT-2013-KutribMW #automaton #finite #multi: One-Way Multi-Head Finite Automata with Pebbles But No States (MK, AM, MW), pp. 313–324.
LATA-2013-Etessami #algorithm #infinity #probability #recursion #verification: Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems (KE), p. 12.
IFM-2013-AndriamiarinaMS #algorithm #distributed #modelling: Integrating Proved State-Based Models for Constructing Correct Distributed Algorithms (MBA, DM, NKS), pp. 268–284.
IFM-2013-GavaFG #algorithm #deduction #verification: Deductive Verification of State-Space Algorithms (FG, JF, MG), pp. 124–138.
IFM-2013-LiuLACSWD #semantics #state machine #uml: A Formal Semantics for Complete UML State Machines with Communications (SL, YL, ÉA, CC, JS, BW, JSD), pp. 331–346.
IFM-2013-Prehofer #behaviour #diagrams #refinement #specification: Assume-Guarantee Specifications of State Transition Diagrams for Behavioral Refinement (CP), pp. 31–45.
CHI-2013-LeithingerFOLHLI #interactive #named #physics: Sublimate: state-changing virtual and physical rendering to augment interaction with shape displays (DL, SF, AO, SL, AH, JL, HI), pp. 1441–1450.
CHI-2013-OdomZFHMCLNLLKRSSM #comprehension: Fragmentation and transition: understanding perceptions of virtual possessions among young adults in Spain, South Korea and the United States (WO, JZ, JF, ALH, MM, JC, YKL, TJN, MHL, YL, DjK, YKR, JS, BS, HM), pp. 1833–1842.
CHI-2013-VoelkerWB #evaluation: An evaluation of state switching methods for indirect touch systems (SV, CW, JOB), pp. 745–754.
CSCW-2013-TeevanH #communication #comprehension #how: Understanding how the projection of availability state impacts the reception incoming communication (JT, AH), pp. 753–758.
HCI-III-2013-SakamotoSYO #3d #metric #using: Evaluating Emotional State during 3DTV Viewing Using Psychophysiological Measurements (KS, SS, KY, AO), pp. 353–361.
HCI-III-2013-ZhangZXHLLY: Alterations in Resting-State after Motor Imagery Training: A Pilot Investigation with Eigenvector Centrality Mapping (RZ, HZ, LX, MH, ZyL, YL, LY), pp. 498–504.
HIMI-HSM-2013-WadaNS #approach: Approach to Haptic Guidance Control in Steering Operation Based on Cooperative States between Driver and Control System (TW, RN, SS), pp. 596–605.
EDOC-2013-0001W #modelling #process: Extracting Data Objects and Their States from Process Models (AM, MW), pp. 27–36.
ICEIS-v2-2013-CuzzocreaF #analysis #comparative #exclamation #metamodelling #power of #state of the art: Comparative Analysis of State-of-the-Art Spatial Data Warehouse Meta-models — Catching the Expressive Power of SDW Schemas! (AC, RdNF), pp. 302–309.
ICML-c1-2013-HamiltonFP #modelling #predict: Modelling Sparse Dynamical Systems with Compressed Predictive State Representations (WLH, MMF, JP), pp. 178–186.
ICML-c1-2013-MaillardNOR #bound #learning #representation: Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning (OAM, PN, RO, DR), pp. 543–551.
KDD-2013-RanuHS #mining #network: Mining discriminative subgraphs from global-state networks (SR, MXH, AKS), pp. 509–517.
KDIR-KMIS-2013-LaneL #concept #prototype: Managing Knowledge in the Three States of Conceptual Discovery, Prototype Invention — Commercial Innovation (JPL, RML), pp. 539–542.
SEKE-2013-SilvaOL #declarative #explosion #modelling #problem #process: A Solution to the State Space Explosion Problem in Declarative Business Process Modeling (S) (NCS, CALO, RMFL), pp. 26–29.
SIGIR-2013-WangLYTWL: The impact of solid state drive on search engine cache management (JW, EL, MLY, JT, GW, XL), pp. 693–702.
ECOOP-2013-SummersD #abstraction #recursion #semantics: A Formal Semantics for Isorecursive and Equirecursive State Abstractions (AJS, SD), pp. 129–153.
OOPSLA-2013-ChongDKKQ #abstraction #analysis #gpu #invariant #kernel: Barrier invariants: a shared state abstraction for the analysis of data-dependent GPU kernels (NC, AFD, PHJK, JK, SQ), pp. 605–622.
POPL-2013-Ley-WildN #concurrent: Subjective auxiliary state for coarse-grained concurrency (RLW, AN), pp. 561–574.
RE-2013-YuAMFC #industrial #state of the art: Practical applications of i∗ in industry: The state of the art (ESKY, DA, GM, XF, JC), pp. 366–367.
SAC-2013-DamakPBC #effectiveness #microblog #state of the art: Effectiveness of state-of-the-art features for microblog search (FD, KPS, MB, GC), pp. 914–919.
SAC-2013-HeckelerSK #component #execution #robust #testing #using: Accelerated robustness testing of state-based components using reverse execution (PH, BS, TK), pp. 1188–1195.
SAC-2013-VukovicD #distributed #estimation #on the #security: On the security of distributed power system state estimation under targeted attacks (OV, GD), pp. 666–672.
ESEC-FSE-2013-LiuL0ZWD #model checking #named #self #state machine #uml: USMMC: a self-contained model checker for UML state machines (SL, YL, JS, MZ, BW, JSD), pp. 623–626.
ICSE-2013-GivensCSY #grammar inference #user interface: Exploring the internal state of user interfaces by combining computer vision techniques with grammatical inference (PG, AC, SS, TY), pp. 1165–1168.
SLE-2013-ErdwegSVBBCGHKLKMPPSSSVVVWW #challenge #state of the art: The State of the Art in Language Workbenches — Conclusions from the Language Workbench Challenge (SE, TvdS, MV, MB, RB, WRC, AG, AH, SK, AL, GDPK, PJM, MP, RP, ES, KS, RS, VAV, EV, KvdV, GW, JvdW), pp. 197–217.
SOSP-2013-BraunFRSBW #verification: Verifying computations with state (BB, AJF, ZR, STVS, AJB, MW), pp. 341–357.
SOSP-2013-CoburnBSGS #transaction: From ARIES to MARS: transaction support for next-generation, solid-state drives (JC, TB, MS, RG, SS), pp. 197–212.
CAV-2013-BarnatBHHKLRSW #c #c++ #model checking #parallel #source code #thread: DiVinE 3.0 — An Explicit-State Model Checker for Multithreaded C & C++ Programs (JB, LB, VH, JH, JK, ML, PR, VS, JW), pp. 863–868.
CAV-2013-BinghamBEG #concurrent #distributed #model checking: Distributed Explicit State Model Checking of Deadlock Freedom (BDB, JDB, JE, MRG), pp. 235–241.
CSL-2013-ChatterjeeF #game studies #infinity: Infinite-state games with finitary conditions (KC, NF), pp. 181–196.
ICST-2013-AliYB #empirical #quality #robust #state machine #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 #state machine: Adaptive Homing and Distinguishing Experiments for Nondeterministic Finite State Machines (NK, KEF, NY), pp. 33–48.
ICTSS-2013-MauserKH #programming #towards #user interface #using: Towards a GUI Test Model Using State Charts and Programming Code (DM, AK, KH), pp. 271–276.
ISSTA-2013-PurandareDE #finite #monitoring #optimisation: Optimizing monitoring of finite state properties through monitor compaction (RP, MBD, SGE), pp. 280–290.
LICS-2013-FiliotGRS #finite #transducer: From Two-Way to One-Way Finite State Transducers (EF, OG, PAR, FS), pp. 468–477.
RTA-2013-BaeEM #infinity #logic #model checking #using: Abstract Logical Model Checking of Infinite-State Systems Using Narrowing (KB, SE, JM), pp. 81–96.
VMCAI-2013-ZhengS0LD0 #network #partial order #reduction #using: State Space Reduction for Sensor Networks Using Two-Level Partial Order Reduction (MZ, DS, JS, YL, JSD, YG), pp. 515–535.
CASE-2012-KimM #modelling #on the #probability #random #throughput: On the throughput of deterministic flow lines with random state dependent setups: Stochastic models and applications (WsK, JRM), pp. 650–655.
CASE-2012-Markovski #framework: A process-theoretic state-based framework for live supervision (JM), pp. 680–685.
CASE-2012-NazeemR #algorithm #performance #resource management: An efficient algorithm for the enumeration of the minimal unsafe states in complex resource allocation systems (AN, SAR), pp. 686–693.
CASE-2012-WuY #estimation #linear #markov #metric #using: State estimation for Markovian Jump Linear System using quantized measurements (HW, HY), pp. 527–531.
DAC-2012-UkhovBEP #analysis #embedded #multi #optimisation #reliability: Steady-state dynamic temperature analysis and reliability optimization for embedded multiprocessor systems (IU, MB, PE, ZP), pp. 197–204.
DATE-2012-BozgaDHHLLT #analysis #embedded #modelling #state of the art #tool support: State-of-the-art tools and techniques for quantitative modeling and analysis of embedded systems (MB, AD, AH, HH, KGL, AL, JT), pp. 370–375.
DATE-2012-BrachtendorfBL #simulation: Simulation of the steady state of oscillators in the time domain (HGB, KB, RL), pp. 1355–1360.
DATE-2012-HanPC #architecture #configuration management #power management: State-based full predication for low power coarse-grained reconfigurable architecture (KH, SP, KC), pp. 1367–1372.
DATE-2012-LinC #adaptation #garbage collection: Dual Greedy: Adaptive garbage collection for page-mapping solid-state disks (WHL, LPC), pp. 117–122.
DATE-2012-NataleZ #finite #implementation #state machine: Task implementation of synchronous finite state machines (MDN, HZ), pp. 206–211.
DATE-2012-Peraldi-FratiBKK #modelling: Timing Modeling with AUTOSAR — Current state and future directions (MAPF, HB, DK, SK), pp. 805–809.
DATE-2012-XieLWPSC #energy #health #hybrid: State of health aware charge management in hybrid electrical energy storage systems (QX, XL, YW, MP, DS, NC), pp. 1060–1065.
SIGMOD-2012-FreireBS #challenge #database #research #state of the art: Computational reproducibility: state-of-the-art, challenges, and database research opportunities (JF, PB, DS), pp. 593–596.
ITiCSE-2012-BrownCDGHMNPPSSSSS #education: Anatomy, dissection, and mechanics of an introductory cyber-security course’s curriculum at the United States naval academy (CB, FC, RD, RG, CH, JM, DN, AP, AP, SS, JS, SS, DS, SS), pp. 303–308.
ESOP-2012-FajstrupGHMR #performance #reduction: Trace Spaces: An Efficient New Technique for State-Space Reduction (LF, EG, EH, SM, MR), pp. 274–294.
CSMR-2012-MaezawaWH #behaviour #internet: Extracting Interaction-Based Stateful Behavior in Rich Internet Applications (YM, HW, SH), pp. 423–428.
PLDI-2012-KuznetsovKBC #execution #performance #symbolic computation: Efficient state merging in symbolic execution (VK, JK, SB, GC), pp. 193–204.
DLT-J-2011-GaoY12 #approximate #complexity: State Complexity and Approximation (YG, SY), pp. 1085–1098.
DLT-J-2011-ZhengQL12 #automaton #finite #quantum: Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States (SZ, DQ, LL), pp. 1117–1130.
CIAA-2012-JiraskovaM #complexity #on the: On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (GJ, TM), pp. 229–239.
DLT-2012-GandhiKL #complexity #finite #on the #word: On State Complexity of Finite Word and Tree Languages (AG, BK, JL), pp. 392–403.
DLT-2012-HromkovicKKS #automaton #logic #nondeterminism #representation: Determinism vs. Nondeterminism for Two-Way Automata — Representing the Meaning of States by Logical Formulæ (JH, RK, RK, RS), pp. 24–39.
DLT-2012-JiraskovaS #complexity: The State Complexity of Star-Complement-Star (GJ, JS), pp. 380–391.
DLT-2012-KutribMW #automaton #finite #multi: States and Heads Do Count for Unary Multi-head Finite Automata (MK, AM, MW), pp. 214–225.
ICALP-v1-2012-ShiW #optimisation: Epsilon-Net Method for Optimizations over Separable States (YS, XW), pp. 798–809.
IFM-2012-GarisPCR #alloy #protocol #specification #state machine #uml: Specifying UML Protocol State Machines in Alloy (AGG, ACRP, AC, DR), pp. 312–326.
SEFM-2012-LefticaruI #algorithm #approach #finite #generative #search-based #state machine #testing #using: An Improved Test Generation Approach from Extended Finite State Machines Using Genetic Algorithms (RL, FI), pp. 293–307.
GRAPHITE-2012-BeckmannFKM #analysis #graph: A structural analysis of the A5/1 state transition graph (AB, JF, JK, UM), pp. 5–19.
GRAPHITE-2012-ZambonR #graph: Graph Subsumption in Abstract State Space Exploration (EZ, AR), pp. 35–49.
GT-VMT-2012-ArijoH #generative #graph transformation #modelling: View-based Modelling and State-Space Generation for Graph Transformation Systems (NA, RH).
ICGT-2012-GadducciLV #approximate #infinity #modelling: Exploiting Over- and Under-Approximations for Infinite-State Counterpart Models (FG, ALL, AV), pp. 51–65.
CSCW-2012-WycheG #case study #communication #how #product line #quote: “This is how we do it in my country”: a study of computer-mediated family communication among Kenyan migrants in the United States (SW, REG), pp. 87–96.
EDOC-2012-WangWPSC #process: A State Synchronization Mechanism for Orchestrated Processes (LW, AW, LFP, MvS, CC), pp. 51–60.
ICEIS-v3-2012-XavierN #approach #evaluation #hybrid #information management: A Hybrid Evaluation Approach for the Emotional State of Information Systems Users (RACX, VPdAN), pp. 45–53.
CIKM-2012-ThonangiB0 #concurrent: A practical concurrent index for solid-state drives (RT, SB, JY), pp. 1332–1341.
ICML-2012-HartikainenSS #modelling #predict: State-Space Inference for Non-Linear Latent Force Models with Application to Satellite Orbit Prediction (JH, MS, SS), p. 96.
ICPR-2012-DeshmukhRSL #detection: Vocalization patterns of dairy animals to detect animal state (OD, NR, YS, SL), pp. 254–257.
ICPR-2012-JiangDPL #word: Analyzing the information entropy of states to optimize the number of states in an HMM-based off-line handwritten Arabic word recognizer (ZJ, XD, LP, CL), pp. 697–700.
KEOD-2012-SchlenoffFB #approach #ontology #recognition #using: An Approach to Ontology-based Intention Recognition using State Representations (CS, SF, SB), pp. 178–183.
AMT-2012-SelimCD #model transformation #state of the art #testing: Model transformation testing: the state of the art (GMKS, JRC, JD), pp. 21–26.
ECMFA-2012-BriandLL #data flow #diagrams #integration #sequence #state machine #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 #state machine: 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 #state machine #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 #state machine #uml: Aspect-Oriented Modeling of Mutual Exclusion in UML State Machines (GZ), pp. 162–177.
ICMT-2012-Kosiuczenko #state machine: The Impact of Class Model Redesign on State Machines (PK), pp. 264–279.
TOOLS-EUROPE-2012-BergmannHHRUV #emf #performance #query #state of the art #tool support: Integrating Efficient Model Queries in State-of-the-Art EMF Tools (GB, ÁH, ÁH, IR, ZU, DV), pp. 1–8.
TOOLS-EUROPE-2012-OchoaJC #uml: Non-interference on UML State-Charts (MO, JJ, JC), pp. 219–235.
POPL-2012-VeanesHLMB #algorithm #finite #transducer: Symbolic finite state transducers: algorithms and applications (MV, PH, BL, DM, NB), pp. 137–150.
RE-2012-FuPYMZ #monitoring #requirements #self: Stateful requirements monitoring for self-repairing socio-technical systems (LF, XP, YY, JM, WZ), pp. 121–130.
SAC-2012-JeremicMBR #operating system: Operating system support for dynamic over-provisioning of solid state drives (NJ, GM, AB, JR), pp. 1753–1758.
SAC-2012-ScandurraAYD #case study #functional #modelling #requirements #state machine #validation: Functional requirements validation by transforming use case models into Abstract State Machines (PS, AA, TY, MD), pp. 1063–1068.
SAC-2012-ZurowskaD #execution #state machine #symbolic computation #uml: Symbolic execution of UML-RT State Machines (KZ, JD), pp. 1292–1299.
ICSE-2012-Camilli #analysis #in the cloud #petri net: Petri nets state space analysis in the cloud (MC), pp. 1638–1640.
ICSE-2012-MollerS #automation #detection: Automated detection of client-state manipulation vulnerabilities (AM, MS), pp. 749–759.
SLE-2012-StevensonC #bibliography #grammar inference #re-engineering #state of the art: Grammatical Inference in Software Engineering: An Overview of the State of the Art (AS, JRC), pp. 204–223.
ASPLOS-2012-CaulfieldMEDCS #performance: Providing safe, user space access to fast, solid state disks (AMC, TIM, LAE, AD, JC, SS), pp. 387–400.
ICST-2012-EndoS #comparison #finite #generative #state machine #testing: Experimental Comparison of Test Case Generation Methods for Finite State Machines (ATE, AdSS), pp. 549–558.
ICST-2012-JagannathKLM #independence #metric: Evaluating Machine-Independent Metrics for State-Space Exploration (VJ, MK, YL, DM), pp. 320–329.
ICST-2012-PetrenkoSY #finite #generative #nondeterminism #sequence #state machine: Generating Checking Sequences for Nondeterministic Finite State Machines (AP, AdSS, NY), pp. 310–319.
ICTSS-2012-DangS #estimation #hybrid #testing: State Estimation and Property-Guided Exploration for Hybrid Systems Testing (TD, NS), pp. 152–167.
ICTSS-2012-Vaandrager #finite #learning #state machine: Active Learning of Extended Finite State Machines (FWV), pp. 5–7.
ISSTA-2012-AlshahwanH #detection #fault #testing #web: State aware test case regeneration for improving web application test suite coverage and fault detection (NA, MH), pp. 45–55.
ASE-2011-BokorKSS #partial order #reduction: Supporting domain-specific state space reductions through local partial-order reduction (PB, JK, MS, NS), pp. 113–122.
ASE-2011-ParizekL #identification #traversal: Identifying future field accesses in exhaustive state space traversal (PP, OL), pp. 93–102.
ASE-2011-WeiRFPHSNM #contract #fault #testing: Stateful testing: Finding more errors in code and contracts (YW, HR, CAF, YP, AH, MJS, MN, BM), pp. 440–443.
CASE-2011-Gonzalez-CastoloL #analysis #fuzzy #nondeterminism: State uncertainty analysis of Fuzzy Timed DES (JCGC, ELM), pp. 600–606.
CASE-2011-RodriguezQLF #estimation #parametricity: State and parameter estimation of an anaerobic digester model (AR, GQ, JdL, RF), pp. 690–695.
DAC-2011-ChangS #approach: Plugging versus logging: a new approach to write buffer management for solid-state disks (LPC, YCS), pp. 23–28.
DAC-2011-IqbalSH #dependence #fault #monte carlo #named #power management #probability #scheduling: SEAL: soft error aware low power scheduling by Monte Carlo state space under the influence of stochastic spatial and temporal dependencies (NI, MAS, JH), pp. 134–139.
DAC-2011-TorranceJ #reverse engineering #state of the art: The state-of-the-art in semiconductor reverse engineering (RT, DJ), pp. 333–338.
DATE-2011-ChangMFWHYN #architecture #hardware #hybrid #optimisation: Optimization of stateful hardware acceleration in hybrid architectures (XC, YM, HF, KW, RH, HY, TN), pp. 567–570.
DATE-2011-CroneBCDER #state of the art #verification: State of the art verification methodologies in 2015 (AC, OB, CC, BD, VE, MR), p. 1339.
DATE-2011-DOrazioVD #challenge #network #state of the art: Sensor networks on the car: State of the art and future challenges (LD, FV, MD), pp. 1030–1035.
DATE-2011-MazzilloFFMRZ #detection: Solid state photodetectors for nuclear medical imaging applications (MM, PGF, EF, AM, MR, RZ), pp. 511–512.
DATE-2011-SinhaP #representation #state machine #synthesis: Abstract state machines as an intermediate representation for high-level synthesis (RS, HDP), pp. 1406–1411.
DATE-2011-WangKAWMA #energy #simulation #using: Accelerated simulation of tunable vibration energy harvesting systems using a linearised state-space technique (LW, TJK, BMAH, ASW, GVM, INAG), pp. 1267–1272.
ICDAR-2011-ChowdhuryGC #finite #online #recognition #transducer: A Weighted Finite-State Transducer (WFST)-Based Language Model for Online Indic Script Handwriting Recognition (SC, UG, TC), pp. 599–602.
ICDAR-2011-YamazoeEYT #approach #finite #recognition #transducer: Hypothesis Preservation Approach to Scene Text Recognition with Weighted Finite-State Transducer (TY, ME, TY, KT), pp. 359–363.
VLDB-2012-RohPKSL11 #optimisation #parallel: B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives (HR, SP, SK, MS, SWL), pp. 286–297.
ESOP-2011-GuhaSK #analysis #type system #using: Typing Local Control and State Using Flow Analysis (AG, CS, SK), pp. 256–275.
FoSSaCS-2011-SchwinghammerBS #metric #recursion: A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces (JS, LB, KS), pp. 305–319.
TACAS-2011-WimmelW #equation #petri net: Applying CEGAR to the Petri Net State Equation (HW, KW), pp. 224–238.
SCAM-J-2009-TiarksKF11 #assessment #detection #state of the art #tool support: An extended assessment of type-3 clones as detected by state-of-the-art tools (RT, RK, RF), pp. 295–331.
PEPM-2011-Caballero #functional #logic programming #program transformation #source code: A program transformation for returning states in functional-logic programs (RC), pp. 111–120.
PLDI-2011-BestMMRFB #scheduling: Synchronization via scheduling: techniques for efficiently managing shared state (MJB, SM, CM, MR, AF, AB), pp. 640–652.
CIAA-J-2010-AllauzenRS11 #algorithm #composition #finite #performance #transducer: A Filter-Based Algorithm for Efficient Composition of Finite-State Transducers (CA, MR, JS), pp. 1781–1795.
CIAA-J-2010-CuiGKY11 #complexity: State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection (BC, YG, LK, SY), pp. 1797–1812.
DLT-J-2010-BrodaMMR11 #approach #automaton #combinator #complexity #on the: On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach (SB, AM, NM, RR), pp. 1593–1606.
DLT-J-2010-PribavkinaR11 #complexity: State Complexity of Code Operators (EVP, ER), pp. 1669–1681.
AFL-2011-Umeo #2d #algorithm #automaton #implementation: Recent Developments in Firing Squad Synchronization Algorithms for Two-Dimensional Cellular Automata and Their State-Efficient Implementations (HU), pp. 368–387.
CIAA-2011-DaciukW #automaton #finite #representation: Smaller Representation of Finite State Automata (JD, DW), pp. 118–129.
CIAA-2011-HolzerKM #complexity #nondeterminism: Nondeterministic State Complexity of Star-Free Languages (MH, MK, KM), pp. 178–189.
CIAA-2011-KushikEY #adaptation #finite #nondeterminism #state machine: Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines (NK, KEF, NY), pp. 215–224.
CIAA-2011-PajicPP #approach #finite #information management #transducer: Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach (VP, GPL, MP), pp. 282–289.
DLT-2011-Kasprzik #automaton #finite #query: Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data (AK), pp. 476–477.
DLT-2011-YuG #approximate #complexity #research: State Complexity Research and Approximation (SY, YG), pp. 46–57.
ICALP-v2-2011-ZhangB #model checking #probability: A Progress Measure for Explicit-State Probabilistic Model-Checkers (XZ, FvB), pp. 283–294.
LATA-2011-SalomaaSY #complexity: Undecidability of the State Complexity of Composed Regular Operations (AS, KS, SY), pp. 489–498.
IFM-J-2009-BenesBBCSV11 #automaton #component #ltl #partial order #reduction: Partial order reduction for state/event LTL with application to component-interaction automata (NB, LB, BB, IC, JS, PV), pp. 877–890.
FM-2011-ZhangSPLD #on the #reduction: On Combining State Space Reductions with Global Fairness Assumptions (SJZ, JS, JP, YL, JSD), pp. 432–447.
SEFM-2011-MoriLDID #adaptation #configuration management #self: Leveraging State-Based User Preferences in Context-Aware Reconfigurations for Self-Adaptive Systems (MM, FL, CD, PI, SD), pp. 286–301.
SFM-2011-IssarnyBB #middleware #state of the art #synthesis: Middleware-Layer Connector Synthesis: Beyond State of the Art in Middleware Interoperability (VI, AB, YDB), pp. 217–255.
IFL-2011-KoopmanAP #logic #modelling #state machine #testing: Model Based Testing with Logical Properties versus State Machines (PWMK, PA, RP), pp. 116–133.
AGTIVE-2011-StroblM #diagrams #editing #generative #graph transformation #state machine: Generating Graph Transformation Rules from AML/GT State Machine Diagrams for Building Animated Model Editors (TS, MM), pp. 65–80.
CHI-2011-EppLM #identification #using: Identifying emotional states using keystroke dynamics (CE, ML, RLM), pp. 715–724.
HCD-2011-ChoiPJP #analysis #research #smarttech #state of the art: Scientometric Analysis of Research in Smart Clothing: State of the Art and Future Direction (KC, HP, ESJ, SP), pp. 500–508.
OCSC-2011-ReedM #education #roadmap: Teacher Agents: The Current State, Future Trends, and Many Roles of Intelligent Agents in Education (KR, GM), pp. 69–78.
KEOD-2011-BouiadjraB #approach #evaluation #ontology #state of the art: Ontology Evaluation — State of the Art, New Approach and Perspectives (ABB, SMB), pp. 365–368.
KEOD-2011-Koit: Conversational Agent in Argumentation — Updating of Information States (MK), pp. 375–378.
SEKE-2011-ZaniFN #agile #architecture: Current State of Reference Architectures in the Context of Agile Methodologies (VATZ, DF, EYN), pp. 590–595.
ICMT-J-2010-DiskinXC11 #bidirectional #model transformation #symmetry: From State- to Delta-Based Bidirectional Model Transformations: the Asymmetric Case (ZD, YX, KC), pp. 137–161.
ICMT-J-2010-GronmoM11 #diagrams #graph transformation #sequence chart #state machine #uml: From UML 2 Sequence Diagrams to State Machines by Graph Transformation (RG, BMP), pp. 182–203.
BX-2011-Diskin1 #bidirectional #model transformation #weaving: From State- to Delta-Based Bidirectional Model Transformations: Unweaving Alignment and Update Propagation (ZD), p. 55.
ECMFA-2011-YueAB #automation #case study #state machine #testing #uml: Automated Transition from Use Cases to UML State Machines to Support State-Based Testing (TY, SA, LCB), pp. 115–131.
MoDELS-2011-DiskinXCEHO #bidirectional #model transformation #symmetry: From State- to Delta-Based Bidirectional Model Transformations: The Symmetric Case (ZD, YX, KC, HE, FH, FO), pp. 304–318.
MoDELS-2011-DiskinXCEHO #bidirectional #model transformation #symmetry: From State- to Delta-Based Bidirectional Model Transformations: The Symmetric Case (ZD, YX, KC, HE, FH, FO), pp. 304–318.
OOPSLA-2011-SunshineNSAT: First-class state change in plaid (JS, KN, SS, JA, ÉT), pp. 713–732.
RE-2011-Berntsson-SvenssonGRTSFA #quality #requirements: Prioritization of quality requirements: State of practice in eleven companies (RBS, TG, BR, RT, AS, RF, AA), pp. 69–78.
SAC-2011-JinKKHM #fine-grained: Sector log: fine-grained storage management for solid state drives (SJ, JHK, JK, JH, SM), pp. 360–367.
SAC-2011-KimDB #dependence #diagrams #identification #state machine #uml: Identifying properties of UML state machine diagrams that affect data and control dependence (HK, VD, DHB), pp. 1464–1469.
SAC-2011-ParkPSP #named: CAVE: channel-aware buffer management scheme for solid state disk (SKP, YP, GS, KHP), pp. 346–353.
SAC-2011-WuW #framework: A data de-duplication access framework for solid state drives (CHW, HSW), pp. 600–604.
ESEC-FSE-2011-Bodden #approach #monitoring #runtime: Stateful breakpoints: a practical approach to defining parameterized runtime monitors (EB), pp. 492–495.
ESEC-FSE-2011-Hall #generative #state machine: Search based hierarchy generation for reverse engineered state machines (MH), pp. 392–395.
HPCA-2011-ChenLZ #memory management #parallel #performance: Essential roles of exploiting internal parallelism of flash memory based solid state drives in high-speed data processing (FC, RL, XZ), pp. 266–277.
LCTES-2011-ChangH #algorithm #low cost: A low-cost wear-leveling algorithm for block-mapping solid-state disks (LPC, LCH), pp. 31–40.
CAV-2011-BaeM #ltl #model checking #parametricity: State/Event-Based LTL Model Checking under Parametric Generalized Fairness (KB, JM), pp. 132–148.
ICST-2011-Bogdanov #generative #testing: Test Generation for X-machines with Non-terminal States and Priorities of Operations (KB), pp. 130–139.
ICST-2011-ChanderDSY #automaton #finite #generative #modelling #sequence: Optimal Test Input Sequence Generation for Finite State Models and Pushdown Systems (AC, DD, KS, DY), pp. 140–149.
ICST-2011-ZhouF #database: Inferential Checking for Mutants Modifying Database States (CZ, PGF), pp. 259–268.
LICS-2011-Pitassi #bibliography #complexity #proving #state of the art: Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results (TP), p. 119.
TAP-2011-Tan #automaton #metric #testing: State Coverage Metrics for Specification-Based Testing with Büchi Automata (LT), pp. 171–186.
TLCA-2011-SvendsenBN #dependent type: Partiality, State and Dependent Types (KS, LB, AN), pp. 198–212.
ASE-2010-BalzSG #maintenance #modelling #state machine #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 #state machine #web: Eliminating navigation errors in web applications via model checking and runtime enforcement of navigation state machines (SH, TE, CB, TB), pp. 235–244.
CASE-2010-GuerreroLBX #hybrid #state of the art: Hybrid/electric vehicle battery manufacturing: The state-of-the-art (CPAG, JL, SB, GX), pp. 281–286.
CASE-2010-LiuCW #programming: Aggregated state dynamic programming for operating theater planning (YL, CC, KW), pp. 1013–1018.
DAC-2010-XiaoSH #algorithm: A universal state-of-charge algorithm for batteries (BX, YS, LH), pp. 687–692.
DAC-2010-ZhangLH #analysis: Separatrices in high-dimensional state space: system-theoretical tangent computation and application to SRAM dynamic stability analysis (YZ, PL, GMH), pp. 567–572.
DATE-2010-YangAFK #design #power management #reliability: Scan based methodology for reliable state retention power gating designs (SY, BMAH, DF, SSK), pp. 69–74.
DocEng-2010-OllisBB #documentation #using: Optimized reprocessing of documents using stored processor state (JAO, DFB, SRB), pp. 135–138.
VLDB-2010-LiH0LY: Tree Indexing on Solid State Drives (YL, BH, JY, QL, KY), pp. 1195–1206.
CSEET-2010-GarousiM #education #recommendation #testing: Current State of the Software Testing Education in North American Academia and Some Recommendations for the New Educators (VG, AM), pp. 89–96.
ESOP-2010-SwamyCC #data flow #policy: Enforcing Stateful Authorization and Information Flow Policies in Fine (NS, JC, RC), pp. 529–549.
ESOP-2010-TovP #contract: Stateful Contracts for Affine Types (JAT, RP), pp. 550–569.
FoSSaCS-2010-SchwinghammerYBPR #semantics: A Semantic Foundation for Hidden State (JS, HY, LB, FP, BR), pp. 2–17.
FoSSaCS-2010-Staton #algebra: Completeness for Algebraic Theories of Local State (SS), pp. 48–63.
TACAS-2010-DragerKFW #concurrent #infinity #model checking #named: SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems (KD, AK, BF, HW), pp. 271–274.
CSMR-2010-MarchettoTR #ajax #approximate #modelling: Under and Over Approximation of State Models Recovered for Ajax Applications (AM, PT, FR), pp. 236–239.
ICSM-2010-PradelBG #evaluation #finite #framework #specification #state machine: A framework for the evaluation of specification miners based on finite state machines (MP, PB, TRG), pp. 1–10.
DLT-J-2008-BassinoGN10 #complexity #finite: The Average State Complexity of Rational Operations on Finite Languages (FB, LG, CN), pp. 495–516.
CIAA-2010-AllauzenRS #composition #finite #performance #transducer: Filters for Efficient Composition of Weighted Finite-State Transducers (CA, MR, JS), pp. 28–38.
CIAA-2010-CuiGKY #complexity: State Complexity of Catenation Combined with Union and Intersection (BC, YG, LK, SY), pp. 95–104.
CIAA-2010-TsaiFVT #automaton: State of Büchi Complementation (MHT, SF, MYV, YKT), pp. 261–271.
DLT-2010-BrodaMMR #automaton #on the: On the Average Number of States of Partial Derivative Automata (SB, AM, NM, RR), pp. 112–123.
DLT-2010-PribavkinaR #complexity #regular expression: State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages (EVP, ER), pp. 376–386.
ICALP-v2-2010-BrazdilJK #game studies #reachability: Reachability Games on Extended Vector Addition Systems with States (TB, PJ, AK), pp. 478–489.
SEFM-2010-TudoseO #design pattern #execution #symbolic computation #testing #using: A Method for Testing Software Systems Based on State Design Pattern Using Symbolic Execution (CT, RO), pp. 113–117.
ICFP-2010-BuissonD #configuration management #execution #named: ReCaml: execution state as the cornerstone of reconfigurations (JB, FD), pp. 27–38.
ICFP-2010-DreyerNB #higher-order #reasoning #relational: The impact of higher-order state and control effects on local relational reasoning (DD, GN, LB), pp. 143–156.
AdaEurope-2010-Keul #detection #version control: Static Versioning of Global State for Race Condition Detection (SK), pp. 111–124.
EDOC-2010-KoegelHLHD #modelling: Comparing State- and Operation-Based Change Tracking on Models (MK, MH, YL, JH, JD), pp. 163–172.
ICEIS-ISAS-2010-DuarteL #architecture #challenge #enterprise #state of the art: Enterprise Architecture — State of the Art and Challenges (JCD, MLM), pp. 101–112.
CIKM-2010-RohLP: Yet another write-optimized DBMS layer for flash-based solid state storage (HR, DL, SP), pp. 1345–1348.
ICML-2010-Mahmud #learning: Constructing States for Reinforcement Learning (MMHM), pp. 727–734.
ICPR-2010-LiP10a #analysis #classification #monitoring #realtime: Human State Classification and Predication for Critical Care Monitoring by Real-Time Bio-signal Analysis (XL, FP), pp. 2460–2463.
ICPR-2010-LlobetCPA #finite #transducer #using: OCR Post-processing Using Weighted Finite-State Transducers (RL, JRCN, JCPC, JA), pp. 2021–2024.
ICPR-2010-SenechalBP #automation #detection #using: Automatic Facial Action Detection Using Histogram Variation Between Emotional States (TS, KB, LP), pp. 3752–3755.
ICPR-2010-SeyedhosseiniPT #classification #image #network #parsing: Image Parsing with a Three-State Series Neural Network Classifier (MS, ARCP, TT), pp. 4508–4511.
KR-2010-Arieli #logic #on the: On the Application of the Disjunctive Syllogism in Paraconsistent Logics Based on Four States of Information (OA).
KR-2010-BaumannBSTZ #calculus: State Defaults and Ramifications in the Unifying Action Calculus (RB, GB, HS, MT, VZ).
SEKE-2010-GoelXS #multi #network #online #verification: A Multi-State Bayesian Network for Shill Verification in Online Auctions (AG, HX, SMS), pp. 279–285.
ICMT-2010-DiskinXC #bidirectional #model transformation: From State- to Delta-Based Bidirectional Model Transformations (ZD, YX, KC), pp. 61–76.
ICMT-2010-GronmoM #diagrams #graph transformation #sequence chart #state machine: From Sequence Diagrams to State Machines by Graph Transformation (RG, BMP), pp. 93–107.
MoDELS-v1-2010-RahimW #code generation #consistency #semantics #state machine #verification: Verifying Semantic Conformance of State Machine-to-Java Code Generators (LAR, JW), pp. 166–180.
MoDELS-v1-2010-SchwarzlP #analysis #consistency #modelling #uml: Static- and Dynamic Consistency Analysis of UML State Chart Models (CS, BP), pp. 151–165.
OOPSLA-2010-KleinFF #higher-order #random testing #source code #testing: Random testing for higher-order, stateful programs (CK, MF, RBF), pp. 555–566.
OOPSLA-2010-McCarthy #continuation: The two-state solution: native and serializable continuations accord (JAM), pp. 567–582.
LOPSTR-2010-FioravantiPPS #evaluation #infinity #verification: Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation (FF, AP, MP, VS), pp. 164–183.
POPL-2010-DreyerNRB #data type #higher-order #logic #relational: A relational modal logic for higher-order stateful ADTs (DD, GN, AR, LB), pp. 185–198.
SAC-2010-AntonelliRL #domain model #identification: Early identification of crosscutting concerns in the domain model guided by states (LA, GR, JCSdPL), pp. 275–280.
SAC-2010-LiuHLW #consistency #migration #network #virtual machine: Network state consistency of virtual machine in live migration (XL, JH, QL, TW), pp. 727–728.
SAC-2010-ParizekY #component #interactive #traversal #using: Extraction of component-environment interaction model using state space traversal (PP, NY), pp. 2203–2210.
FSE-2010-HalleB #analysis #interactive #message passing #using: Realizability analysis for message-based interactions using shared-state projections (SH, TB), pp. 27–36.
ICSE-2010-Bodden #analysis #hybrid #performance #type system: Efficient hybrid typestate analysis by determining continuation-equivalent states (EB), pp. 5–14.
HPCA-2010-JafriTV #named #transaction: LiteTM: Reducing transactional state overhead (SARJ, MT, TNV), pp. 1–12.
HPCA-2010-SunJCNXCL #architecture #energy #hybrid #performance: A Hybrid solid-state storage architecture for the performance, energy consumption, and lifetime improvement (GS, YJ, YC, DN, YX, YC, HL), pp. 1–12.
ISMM-2010-TianFG #parallel #predict #using: Speculative parallelization using state separation and multiple value prediction (CT, MF, RG), pp. 63–72.
ICST-2010-Irfan #state machine #testing: State Machine Inference in Testing Context with Long Counterexamples (MNI), pp. 508–511.
ICST-2010-Weissleder #state machine #test coverage #uml: Simulated Satisfaction of Coverage Criteria on UML State Machines (SW), pp. 117–126.
ICST-2010-XuD #testing: Prioritizing State-Based Aspect Tests (DX, JD), pp. 265–274.
ICTSS-2010-AartsJU #abstraction #communication #generative #infinity #modelling #protocol #using: Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction (FA, BJ, JU), pp. 188–204.
ICTSS-2010-Schieferdecker #automation #perspective #state of the art #testing: Test Automation with TTCN-3 — State of the Art and a Future Perspective (IS), pp. 1–14.
SAT-2010-KlieberSGC #learning: A Non-prenex, Non-clausal QBF Solver with Game-State Learning (WK, SS, SG, EMC), pp. 128–142.
CBSE-2009-BirkmeierO #classification #comparison #component #identification #on the #state of the art: On Component Identification Approaches — Classification, State of the Art, and Comparison (DB, SO), pp. 1–18.
QoSA-2009-BjornanderGL #architecture #simulation #specification #state machine: Timed Simulation of Extended AADL-Based Architecture Specifications with Timed Abstract State Machines (SB, LG, KL), pp. 101–115.
ASE-2009-LauterburgDMA #framework #source code: A Framework for State-Space Exploration of Java-Based Actor Programs (SL, MD, DM, GAA), pp. 468–479.
ASE-2009-TaleghaniA #estimation: State-Space Coverage Estimation (AT, JMA), pp. 459–467.
CASE-2009-AnderssonLFF #generative: Generation of restart states for manufacturing systems with discarded workpieces (KA, BL, PF, MF), pp. 191–196.
CASE-2009-BountourelisR #algorithm #learning: Customized learning algorithms for episodic tasks with acyclic state spaces (TB, SR), pp. 627–634.
CASE-2009-CaldwellM #estimation #higher-order: Second-order optimal estimation of slip state for a simple slip-steered vehicle (TMC, TDM), pp. 133–139.
CASE-2009-MonchZ #case study #experience #prototype #state of the art #web #web service: Providing production planning and control functionality by web services: State of the art and experiences with prototypes (LM, JZ), pp. 495–500.
CASE-2009-Subrahmanian #automation #empirical #workflow: Empirical studies of workflow automation in physician offices in the United States (ES), pp. 83–87.
DAC-2009-KimRH #analysis #probability: Stochastic steady-state and AC analyses of mixed-signal systems (JK, JR, MAH), pp. 376–381.
DAC-2009-VeetilSBSR #analysis #dependence #performance: Efficient smart sampling based full-chip leakage analysis for intra-die variation considering state dependence (VV, DS, DB, SS, SR), pp. 154–159.
DAC-2009-VishnoiPB #debugging #online: Online cache state dumping for processor debug (AV, PRP, MB), pp. 358–363.
DAC-2009-YuanX #identification #on the #pseudo #testing: On systematic illegal state identification for pseudo-functional testing (FY, QX), pp. 702–707.
DATE-2009-DarbariAFB #design #simulation #using: Selective state retention design using symbolic simulation (AD, BMAH, DF, JB), pp. 1644–1649.
DocEng-2009-BattleB #behaviour #concurrent #documentation #modelling #state machine: Modelling composite document behaviour with concurrent hierarchical state machines (SB, HB), pp. 25–28.
SIGMOD-2009-TsirogiannisHSWG #query: Query processing techniques for solid state drives (DT, SH, MAS, JLW, GG), pp. 59–72.
VLDB-2009-CanimBMLR #using: An Object Placement Advisor for DB2 Using Solid State Storage (MC, BB, GAM, CAL, KAR), pp. 1318–1329.
ITiCSE-2009-MarcosFM #education #uml: The two states of the mind to teach UML (LdM, FF, JJM), p. 361.
WRLA-2008-HassN09 #abstraction #equation: Equational Abstractions for Reducing the State Space of Rewrite Theories (LHH, TN), pp. 139–154.
WRLA-2008-Rodriguez09: Combining Techniques to Reduce State Space and Prove Strong Properties (DER), pp. 267–280.
FASE-2009-AndroutsopoulosCHLT #dependence #finite #state machine: Control Dependence for Extended Finite State Machines (KA, DC, MH, ZL, LT), pp. 216–230.
TACAS-2009-MateescuW #adaptation: Hierarchical Adaptive State Space Caching Based on Level Sampling (RM, AW), pp. 215–229.
SCAM-2009-TiarksKF #assessment #detection #state of the art #tool support: An Assessment of Type-3 Clones as Detected by State-of-the-Art Tools (RT, RK, RF), pp. 67–76.
WCRE-1999-BogdanovW99a #difference #modelling: Computing the Structural Difference between State-Based Models (KB, NW), pp. 177–186.
CIAA-J-2008-AllauzenM09 #composition #finite #transducer: N-Way Composition of Weighted Finite-State Transducers (CA, MM), pp. 613–627.
CIAA-2009-AhnH #heuristic #implementation #using: Implementation of State Elimination Using Heuristics (JHA, YSH), pp. 178–187.
CIAA-2009-Barthelemy #finite #framework #testing: A Testing Framework for Finite-State Morphology (FB), pp. 75–83.
CIAA-2009-HolzerM #algorithm #automaton: An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (MH, AM), pp. 4–13.
CIAA-2009-Savary #finite #multi #named: Multiflex: A Multilingual Finite-State Tool for Multi-Word Units (AS), pp. 237–240.
ICALP-v2-2009-AcciaiB #behaviour #infinity #safety #π-calculus: Deciding Safety Properties in Infinite-State π-Calculus via Behavioural Types (LA, MB), pp. 31–42.
LATA-2009-BoigelotD #automaton #finite #set #visualisation: Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (BB, JFD), pp. 200–211.
LATA-2009-HanSY #complexity #regular expression: State Complexity of Combined Operations for Prefix-Free Regular Languages (YSH, KS, SY), pp. 398–409.
LATA-2009-Salomaa #automaton #complexity #word: State Complexity of Nested Word Automata (KS), pp. 59–70.
FM-2009-SaidBS #refinement #state machine #tool support #uml: Language and Tool Support for Class and State Machine Refinement in UML-B (MYS, MJB, CFS), pp. 579–595.
IFM-2009-BenesBCSVZ #ltl #partial order #reduction: Partial Order Reduction for State/Event LTL (NB, LB, IC, JS, PV, BZ), pp. 307–321.
IFM-2009-ColvinH #csp: CSP with Hierarchical State (RC, IJH), pp. 118–135.
SEFM-2009-SubramaniamGP #finite #impact analysis #state machine #testing #using: Using Change Impact Analysis to Select Tests for Extended Finite State Machines (MS, BG, ZP), pp. 93–102.
CHI-2009-KristenssonD #case study #performance #recognition #state of the art: Text entry performance of state of the art unconstrained handwriting recognition: a longitudinal user study (POK, LCD), pp. 567–570.
HCI-AUII-2009-DMelloCFG: Responding to Learners’ Cognitive-Affective States with Supportive and Shakeup Dialogues (SKD, SDC, KF, ACG), pp. 595–604.
AdaEurope-2009-SaezTGC #ada #implementation #state machine #uml: Implementing Reactive Systems with UML State Machines and Ada 2005 (SS, ST, VLG, AC), pp. 149–163.
EDOC-2009-AtkinsonB #development #towards: Towards a Client-Oriented Model of Types and States in Service-Oriented Development (CA, PB), pp. 119–127.
CIKM-2009-DaM #named #optimisation #random: RS-Wrapper: random write optimization for solid state drive (DZ, XM), pp. 1457–1460.
CIKM-2009-MaHR #framework #incremental #mobile #named #predict: iLoc: a framework for incremental location-state acquisition and prediction based on mobile sensors (YM, RH, DR), pp. 1367–1376.
ICML-2009-DoA #markov #modelling #scalability: Large margin training for hidden Markov models with partially observed states (TMTD, TA), pp. 265–272.
ICML-2009-Makino #network #predict #representation: Proto-predictive representation of states with simple recurrent temporal-difference networks (TM), pp. 697–704.
KMIS-2009-AzevedoS #roadmap #state of the art: Business Intelligence — State of the Art, Trends, and Open Issues (AA, MFS), pp. 296–300.
MoDELS-2009-DawV #modelling #process #state machine #uml: Deterministic UML Models for Interconnected Activities and State Machines (ZD, MV), pp. 556–570.
MoDELS-2009-Weissleder #industrial #modelling #state machine #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 #state machine #uml: Deterministic UML Models for Interconnected Activities and State Machines (ZD, MV), pp. 556–570.
MoDELS-2009-Weissleder #industrial #modelling #state machine #testing #uml: Influencing Factors in Model-Based Testing with UML State Machines: Report on an Industrial Cooperation (SW), pp. 211–225.
ECOOP-2009-CutsemBDM #using: Adding State and Visibility Control to Traits Using Lexical Nesting (TVC, AB, SD, WDM), pp. 220–243.
POPL-2009-AhmedDR #independence #representation: State-dependent representation independence (AA, DD, AR), pp. 340–353.
SAC-2009-ChoppyR #state machine #uml: A method for developing UML state machines (CC, GR), pp. 382–388.
SAC-2009-LeeBPCLN #configuration management #named #precise: CPS-SIM: configurable and accurate clock precision solid state drive simulator (JL, EB, HP, JC, DL, SHN), pp. 318–325.
ESEC-FSE-2009-MaiaKUM #modelling #probability #refinement #towards #using: Towards accurate probabilistic models using state refinement (PHMM, JK, SU, NCM), pp. 281–284.
ESEC-FSE-2009-ZhangCTJW: Capturing propagation of infected program states (ZZ, WKC, THT, BJ, XW), pp. 43–52.
ICSE-2009-CasoBGU #abstraction #contract #finite #using #validation: Validation of contracts using enabledness preserving finite state abstractions (GdC, VAB, DG, SU), pp. 452–462.
CAV-2009-HahnHWZ #infinity #markov #model checking #named: INFAMY: An Infinite-State Markov Model Checker (EMH, HH, BW, LZ), pp. 641–647.
ICLP-2009-Rosa #detection #distributed #programming: Locally Distributed Predicates: A Programming Facility for Distributed State Detection (MD), pp. 557–558.
ICST-2009-BandyopadhyayG #generative #modelling #sequence #state machine #uml #using: Test Input Generation Using UML Sequence and State Machines Models (AB, SG), pp. 121–130.
ICST-2009-KalajiHS #finite #generative #state machine #testing: Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM) (ASK, RMH, SS), pp. 230–239.
LICS-2009-Clarke #explosion #problem: My 27-year Quest to Overcome the State Explosion Problem (EMC), p. 3.
TestCom-FATES-2009-El-FakihYF #fault #finite #state machine #testing: Testing Timed Finite State Machines with Guaranteed Fault Coverage (KEF, NY, HF), pp. 66–80.
TestCom-FATES-2009-SimaoPY #generative #testing: Generating Reduced Tests for FSMs with Extra States (AdSS, AP, NY), pp. 129–145.
CBSE-2008-LumpeGS #component #interface #reduction: State Space Reduction Techniques for Component Interfaces (ML, LG, JGS), pp. 130–145.
ASE-2008-WalkinshawB #constraints #finite #modelling: Inferring Finite-State Models with Temporal Constraints (NW, KB), pp. 248–257.
CASE-2008-Morrison #evolution: Flow lines with regular service times: Evolution of delay, state dependent failures and semiconductor wafer fabrication (JRM), pp. 247–252.
CASE-2008-Pan #distributed #estimation #robust: Decentralized control of vehicles in platoons with robust nonlinear state estimation (YJP), pp. 145–150.
DATE-2008-KoN #automation #identification #validation: Automated Trace Signals Identification and State Restoration for Improving Observability in Post-Silicon Validation (HFK, NN), pp. 1298–1303.
DATE-2008-TenentesKK #testing: State Skip LFSRs: Bridging the Gap between Test Data Compression and Test Set Embedding for IP Cores (VT, XK, EK), pp. 474–479.
DATE-2008-VytyazHMM #analysis #constraints #design #similarity: Periodic Steady-State Analysis Augmented with Design Equality Constraints (IV, PKH, UKM, KM), pp. 312–317.
DocEng-2008-JansenB #adaptation #web: Enabling adaptive time-based web applications with SMIL state (JJ, DCAB), pp. 18–27.
CSEET-2008-PysterTHLBB #re-engineering #source code: The Current State of Software Engineering Masters Degree Programs (ABP, RT, DH, KL, LB, KB), pp. 103–109.
FASE-2008-BergJR #similarity #state machine #testing #using: Regular Inference for State Machines Using Domains with Equality Tests (TB, BJ, HR), pp. 317–331.
FoSSaCS-2008-Goubault-Larrecq #game studies #infinity #probability #simulation: Simulation Hemi-metrics between Infinite-State Stochastic Games (JGL), pp. 50–65.
WCRE-2008-AmalfitanoFT #finite #internet #reverse engineering #state machine: Reverse Engineering Finite State Machines from Rich Internet Applications (DA, ARF, PT), pp. 69–73.
DLT-J-2007-HanS08 #complexity #finite: State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 581–595.
CIAA-2008-AllauzenM #composition #finite #transducer: 3-Way Composition of Weighted Finite-State Transducers (CA, MM), pp. 262–273.
DLT-2008-BassinoGN #complexity #finite #linear #set #word: The Average State Complexity of the Star of a Finite Set of Words Is Linear (FB, LG, CN), pp. 134–145.
DLT-2008-Jiraskova #complexity #on the #regular expression: On the State Complexity of Complements, Stars, and Reversals of Regular Languages (GJ), pp. 431–442.
DLT-2008-JiraskovaO #automaton #complexity #finite #on the: On the State Complexity of Operations on Two-Way Finite Automata (GJ, AO), pp. 443–454.
SEFM-2008-GuoS #finite #impact analysis #proving #state machine #theorem proving #using: Formal Change Impact Analyses of Extended Finite State Machines Using a Theorem Prover (BG, MS), pp. 335–344.
ICGT-2008-Striewe #graph grammar #implementation #state machine #using: Using a Triple Graph Grammar for State Machine Implementations (MS), pp. 514–516.
CHI-2008-WycheAG: Re-placing faith: reconsidering the secular-religious use divide in the United States and Kenya (SW, PMA, REG), pp. 11–20.
CSCW-2008-KuzuokaPSKYYKLH: Effect of restarts and pauses on achieving a state of mutual orientation between a human and a robot (HK, KP, YS, IK, KY, AY, YK, PL, CH), pp. 201–204.
SOFTVIS-2008-SundararamanB #c #c++ #interactive #java #named #runtime #visualisation: HDPV: interactive, faithful, in-vivo runtime state visualization for C/C++ and Java (JS, GB), pp. 47–56.
AdaEurope-2008-AlonsoVPA #ada #modelling #state machine #thread #visual notation: StateML+s: From Graphical State Machine Models to Thread-Safe Ada Code (DA, CVC, JAP, BÁ), pp. 158–170.
ICEIS-ISAS1-2008-LanoC #behaviour #refinement #semantics #state machine: Semantics and Refinement of Behavior State Machines (KL, DC), pp. 42–49.
CIKM-2008-BekkermanS #clustering #scalability #state of the art #weaving: Data weaving: scaling up the state-of-the-art in data clustering (RB, MS), pp. 1083–1092.
ICML-2008-FoxSJW #persistent: An HDP-HMM for systems with state persistence (EBF, EBS, MIJ, ASW), pp. 312–319.
ICML-2008-WingateS #exponential #learning #predict #product line: Efficiently learning linear-linear exponential family predictive representations of state (DW, SPS), pp. 1176–1183.
ICPR-2008-HsiaoCC #recognition #using: Human action recognition using temporal-state shape contexts (PCH, CSC, LWC), pp. 1–4.
ICPR-2008-LiuA #automation #recognition: Automatic eye state recognition and closed-eye photo correction (ZL, HA), pp. 1–4.
ICPR-2008-NingXZGH #detection #difference #learning: Temporal difference learning to detect unsafe system states (HN, WX, YZ, YG, TSH), pp. 1–4.
KDD-2008-Miletzki #pattern matching #pattern recognition #recognition: Genesis of postal address reading, current state and future prospects: thirty years of pattern recognition on duty of postal services (UM), pp. 5–6.
SEKE-2008-AltahatET #analysis #detection #diagrams #graph transformation #interactive #uml: Applying Critical Pair Analysis in Graph Transformation Systems to Detect Syntactic Aspect Interaction in UML State Diagrams (ZA, TE, LT), pp. 905–911.
SEKE-2008-MahoneyE #monitoring #using: Using Scenario Monitoring to Address State Based Crosscutting Concerns (MM, TE), pp. 581–586.
SEKE-2008-ReddyreddyX #using #xml: Securing Service-oriented Systems Using State-Based XML Firewall (AR, HX), pp. 512–518.
ECMDA-FA-2008-Barbier #runtime #state machine #uml: Supporting the UML State Machine Diagramsat Runtime (FB), pp. 338–348.
ICMT-2008-AmstelBPV #algebra #modelling #process #question #semantic gap #state machine #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 #state machine #uml: X3D-UML: 3D UML State Machine Diagrams (PM, MH, RGvS), pp. 264–279.
MoDELS-2008-McIntoshHS #3d #diagrams #named #state machine #uml: X3D-UML: 3D UML State Machine Diagrams (PM, MH, RGvS), pp. 264–279.
ECOOP-2008-ArtziKE #named: ReCrash: Making Software Failures Reproducible by Preserving Object States (SA, SK, MDE), pp. 542–565.
ECOOP-2008-ChinM #interactive #state machine: An Extensible State Machine Pattern for Interactive Applications (BC, TDM), pp. 566–591.
TOOLS-EUROPE-2008-AydalUW #comparison #modelling #tool support #validation: A Comparison of State-Based Modelling Tools for Model Validation (EGA, MU, JW), pp. 278–296.
TOOLS-EUROPE-2008-GrondinBV #adaptation #component #self: Component Reassembling and State Transfer in MaDcAr-Based Self-adaptive Software (GG, NB, LV), pp. 258–277.
TOOLS-EUROPE-2008-PhinkY #aspect-oriented #virtual machine: Virtual Machine Support for Stateful Aspects (YP, AY), pp. 80–99.
POPL-2008-Chaudhuri #algorithm #recursion #state machine: Subcubic algorithms for recursive state machines (SC), pp. 159–169.
SAC-2008-LecueDL #composition #independence #semantics #towards #web #web service: Towards the composition of stateful and independent semantic web services (FL, AD, AL), pp. 2279–2285.
SAC-2008-LiQWLW #consistency #diagrams #interactive #java #runtime #source code #state machine #uml #verification: UML state machine diagram driven runtime verification of Java programs for message interaction consistency (XL, XQ, LW, BL, WEW), pp. 384–389.
SAC-2008-PeristerasLT #domain model #modelling #state of the art: Organizational engineering in public administration: the state of the art on eGovernment domain modeling (VP, NL, KAT), pp. 580–587.
ICSE-2008-GveroGL #java: State extensions for java pathfinder (TG, MG, SL, Md, DM, SK), pp. 863–866.
ICSE-2008-LauterburgSMV #incremental #source code: Incremental state-space exploration for programs with dynamically allocated data (SL, AS, DM, MV), pp. 291–300.
HPDC-2008-SmithSF #grid: Securing stateful grid servers through virtual server rotation (MS, CS, BF), pp. 11–22.
OSDI-2008-MaoJM #named #performance #state machine: Mencius: Building Efficient Replicated State Machine for WANs (YM, FPJ, KM), pp. 369–384.
ICST-2008-El-FakihKPY #fault #finite #state machine: 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 #state machine #testing: Functional Search-based Testing from State Machines (RL, FI), pp. 525–528.
ICST-2008-MarchettoTR #ajax #testing #web: State-Based Testing of Ajax Web Applications (AM, PT, FR), pp. 121–130.
ICST-2008-RamirezC #adaptation #logic #modelling #uml #verification: Verifying and Analyzing Adaptive Logic through UML State Models (AJR, BHCC), pp. 529–532.
LICS-2008-ChadhaSV #complexity #finite #monitoring #on the: On the Expressiveness and Complexity of Randomization in Finite State Monitors (RC, APS, MV), pp. 18–29.
LICS-2008-Pottier #anti #higher-order: Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule (FP), pp. 331–340.
TestCom-FATES-2008-SimaoP #finite #generative #sequence #state machine: Generating Checking Sequences for Partial Reduced Finite State Machines (AdSS, AP), pp. 153–168.
ASE-2007-Hall #infinity #modelling #named #realtime #validation: Rteq: modeling and validating infinite-state hard-real-time systems (RJH), pp. 481–484.
CASE-2007-CabasinoGMRSS #estimation #petri net: State Estimation of Petri Nets by Transformation (MPC, AG, CM, LR, CS, MS), pp. 194–199.
CASE-2007-Gonzalez-CastoloL #approximate #fuzzy #petri net #using: Approximating State of DES Using Fuzzy Timed Petri Nets (JCGC, ELM), pp. 722–728.
CASE-2007-GuoZW #automation #design #diagrams #flexibility #named #state machine: DiagramDraw: A State Machine Diagram Designer for Flexible Automation (WG, MZ, DW), pp. 352–356.
DAC-2007-PiyachonL #pattern matching #performance #state machine: Compact State Machines for High Performance Pattern Matching (PP, YL), pp. 493–496.
DAC-2007-SrivastavaR #equation: Interdependent Latch Setup/Hold Time Characterization via Euler-Newton Curve Tracing on State-Transition Equations (SS, JSR), pp. 136–141.
DATE-2007-MoonBP #approach #composition #equivalence: A compositional approach to the combination of combinational and sequential equivalence checking of circuits without known reset states (IHM, PB, CP), pp. 1170–1175.
ICDAR-2007-BeaufortM #fault #finite #framework: A Weighted Finite-State Framework for Correcting Errors in Natural Scene OCR (RB, CMT), pp. 889–893.
ICDAR-2007-KramerKKB #finite #metadata #probability #transducer #using: Bibliographic Meta-Data Extraction Using Probabilistic Finite State Transducers (MK, HK, DK, TMB), pp. 609–613.
FASE-2007-HennickerK #state machine #synthesis: Activity-Driven Synthesis of State Machines (RH, AK), pp. 87–101.
FASE-2007-SanchezSM #concurrent #distributed #product line #protocol: A Family of Distributed Deadlock Avoidance Protocols and Their Reachable State Spaces (CS, HBS, ZM), pp. 155–169.
FoSSaCS-2007-YoshidaHB #higher-order #logic #reasoning: Logical Reasoning for Higher-Order Functions with Local State (NY, KH, MB), pp. 361–377.
TACAS-2007-BouajjaniJS #framework #infinity #network #process #reasoning: A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes (AB, YJ, MS), pp. 690–705.
TACAS-2007-JhalaMX #type inference: State of the Union: Type Inference Via Craig Interpolation (RJ, RM, RGX), pp. 553–567.
TACAS-2007-RasmussenBL #complexity #flexibility: Complexity in Simplicity: Flexible Agent-Based State Space Exploration (JIR, GB, KGL), pp. 231–245.
WCRE-2007-WalkinshawBHS #grammar inference #interactive #reverse engineering #state machine: Reverse Engineering State Machines by Interactive Grammar Inference (NW, KB, MH, SS), pp. 209–218.
CIAA-J-2006-SalomaaY07 #complexity #estimation #on the: On the State Complexity of Combined Operations and their Estimation (KS, SY), pp. 683–698.
CIAA-2007-AllauzenRSSM #finite #library #named #performance #transducer: OpenFst: A General and Efficient Weighted Finite-State Transducer Library (CA, MR, JS, WS, MM), pp. 11–23.
CIAA-2007-BlancCW #finite: A Finite-State Super-Chunker (OB, MC, PW), pp. 306–308.
CIAA-2007-JonoskaP #2d #automaton #finite #representation: Finite State Automata Representing Two-Dimensional Subshifts (NJ, JBP), pp. 277–289.
DLT-2007-GruberH #complexity #exclamation #nondeterminism: Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP (HG, MH), pp. 205–216.
DLT-2007-HanS #complexity #finite: State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 217–228.
ICALP-2007-Goubault-Larrecq: Continuous Capacities on Continuous State Spaces (JGL), pp. 764–776.
ICALP-2007-TorreP #complexity #model checking #on the #recursion #state machine: On the Complexity of LtlModel-Checking of Recursive State Machines (SLT, GP), pp. 937–948.
LATA-2007-LiuMSY #complexity: State Complexity of Basic Operations Combined with Reversal (GL, CMV, AS, SY), pp. 355–366.
LATA-2007-Martugin #automaton: A series of slowly synchronizable automata with a zero state over a small alphabet (PVM), pp. 391–402.
LATA-2007-TorreNPP #state machine #verification: Verification of Succinct Hierarchical State Machines (SLT, MN, MP, GP), pp. 485–496.
IFM-2007-Chen #process: Inheriting Laws for Processes with States (YC), pp. 138–155.
IFM-2007-GheorghiuGC #logic #query: Finding State Solutions to Temporal Logic Queries (MG, AG, MC), pp. 273–292.
IFM-2007-KarkinskyST: Combining Mobility with State (DK, SAS, HT), pp. 373–392.
SEFM-2007-RungtaM #benchmark #metric #model checking: Hardness for Explicit State Software Model Checking Benchmarks (NR, EGM), pp. 247–256.
SFM-2007-KnottenbeltB #modelling #performance #scalability: Tackling Large State Spaces in Performance Modelling (WJK, JTB), pp. 318–370.
AGTIVE-2007-Kurtev #model transformation #qvt #standard #state of the art: State of the Art of QVT: A Model Transformation Language Standard (IK), pp. 377–393.
GT-VMT-2007-KraemerH #collaboration #execution #specification #state machine: Transforming Collaborative Service Specifications into Efficiently Executable State Machines (FAK, PH).
HCI-MIE-2007-LeePL #finite #multi #recognition #transducer: Multi-word Expression Recognition Integrated with Two-Level Finite State Transducer (KL, KSP, YSL), pp. 124–133.
OCSC-2007-YusopAIRO #internet #knowledge-based: Rural Internet Centre (RIC) as Catalysts for Building Knowledge-Based Society — The Case of Northern States of Malaysia (NIY, ZMA, HI, RAR, WRSO), pp. 485–490.
CAiSE-2007-MendlingA #formal method #verification: Formalization and Verification of EPCs with OR-Joins Based on State and Context (JM, WMPvdA), pp. 439–453.
ICEIS-J-2007-ShishkovS07a: From User Context States to Context-Aware Applications (BS, MvS), pp. 225–239.
ICML-2007-OsentoskiM #learning: Learning state-action basis functions for hierarchical MDPs (SO, SM), pp. 705–712.
MLDM-2007-CandillierMB #collaboration #state of the art: Comparing State-of-the-Art Collaborative Filtering Systems (LC, FM, MB), pp. 548–562.
SEKE-2007-XuXW #automation #code generation #protocol #state machine #uml: Automated Test Code Generation from UML Protocol State Machines (DX, WX, WEW), pp. 99–104.
MoDELS-2007-SteimannK #modelling #type system: Piecewise Modelling with State Subtypes (FS, TK), pp. 181–195.
MoDELS-2007-WhittleMAJER #composition #diagrams #uml: An Expressive Aspect Composition Language for UML State Diagrams (JW, AMDM, JA, PKJ, AME, RR), pp. 514–528.
MoDELS-2007-ZhangHK #aspect-oriented #state machine #uml: Enhancing UML State Machines with Aspects (GZ, MMH, AK), pp. 529–543.
MoDELS-2007-SteimannK #modelling #type system: Piecewise Modelling with State Subtypes (FS, TK), pp. 181–195.
MoDELS-2007-WhittleMAJER #composition #diagrams #uml: An Expressive Aspect Composition Language for UML State Diagrams (JW, AMDM, JA, PKJ, AME, RR), pp. 514–528.
MoDELS-2007-ZhangHK #aspect-oriented #state machine #uml: Enhancing UML State Machines with Aspects (GZ, MMH, AK), pp. 529–543.
TOOLS-EUROPE-2007-LanoC #semantics #state machine: Direct Semantics of Extended State Machines (KL, DC), pp. 35–51.
POPL-2007-StovringL #induction: A complete, co-inductive syntactic theory of sequential control and state (KS, SBL), pp. 161–172.
ESEC-FSE-2007-KosterK #behaviour #test coverage #testing: State coverage: a structural test adequacy criterion for behavior checking (KK, DCK), pp. 541–544.
ESEC-FSE-2007-SankaranarayananCJI #constraints #feedback #generative #monte carlo #using: State space exploration using feedback constraint generation and Monte-Carlo sampling (SS, RMC, GJ, FI), pp. 321–330.
GTTSE-2007-JuhaszSP #c++ #finite #implementation #library #state machine: Implementation of a Finite State Machine with Active Libraries in C++ (ZJ, ÁS, ZP), pp. 474–488.
ICSE-2007-DwyerEPP #parallel #random: Parallel Randomized State-Space Search (MBD, SGE, SP, RP), pp. 3–12.
ICSE-2007-YuanM #feedback #runtime #testing #user interface #using: Using GUI Run-Time State as Feedback to Generate Test Cases (XY, AMM), pp. 396–405.
SPLC-2007-BeucheBDFGHJJKMW #product line #requirements #tool support #using: Using Requirements Management Tools in Software Product Line Engineering: The State of the Practice (DB, AB, HD, AF, HG, GH, DJ, IJ, RTK, TvdM, AW), pp. 84–96.
LCTES-2007-HuangCTC #automation #fault #locality #statistics: Automated fault localization with statistically suspicious program states (TYH, PCC, CHT, HAC), pp. 11–20.
PPoPP-2007-BaudeCDH #consistency: Promised messages: recovering from inconsistent global states (FB, DC, CD, LH), pp. 154–155.
PPoPP-2007-SchuffCP #detection #network #parallel: Conservative vs. optimistic parallelization of stateful network intrusion detection (DLS, YRC, VSP), pp. 138–139.
AMOST-2007-FarooqIMN #approach #state machine #testing: An approach for selective state machine based regression testing (QuaF, MZZI, ZIM, AN), pp. 44–52.
CADE-2007-GhilardiNRZ #infinity #model checking #satisfiability: Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems (SG, EN, SR, DZ), pp. 362–378.
CAV-2007-AbdullaDR #infinity #process #verification: Parameterized Verification of Infinite-State Processes with Global Conditions (PAA, GD, AR), pp. 145–157.
CAV-2007-EzekielLC #generative: Parallelising Symbolic State-Space Generators (JE, GL, GC), pp. 268–280.
ISSTA-2007-dAmorimLM #execution #object-oriented #performance #source code: Delta execution for efficient state-space exploration of object-oriented programs (Md, SL, DM), pp. 50–60.
LICS-2007-KahlerKT #encryption #infinity #model checking #protocol: Infinite State AMC-Model Checking for Cryptographic Protocols (DK, RK, TT), pp. 181–192.
MBT-2007-OuimetL #automation #consistency #satisfiability #specification #state machine #using #verification: Automated Verification of Completeness and Consistency of Abstract State Machine Specifications using a SAT Solver (MO, KL), pp. 85–97.
RTA-2007-EscobarM #infinity #model checking #using: Symbolic Model Checking of Infinite-State Systems Using Narrowing (SE, JM), pp. 153–168.
TestCom-FATES-2007-PapSKN #algorithm #bound #finite #generative #incremental #state machine #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 #state machine #testing: Testing Nondeterministic Finite State Machines with Respect to the Separability Relation (NS, KEF, NY), pp. 305–318.
CBSE-2006-AttieLPC #behaviour #component #design #explosion #verification: Behavioral Compatibility Without State Explosion: Design and Verification of a Component-Based Elevator Control System (PCA, DHL, AP, HC), pp. 33–49.
CASE-2006-ReveliotisB #algorithm #learning #performance: Efficient learning algorithms for episodic tasks with acyclic state spaces (SR, TB), pp. 411–418.
DAC-2006-CarmonaC #encoding #scalability: State encoding of large asynchronous controllers (JC, JC), pp. 939–944.
DAC-2006-VimjamH #identification #induction #performance #satisfiability: Fast illegal state identification for improving SAT-based induction (VCV, MSH), pp. 241–246.
DATE-2006-KumarA #power management: An analytical state dependent leakage power model for FPGAs (AK, MA), pp. 612–617.
DATE-2006-PanditKMP #hardware #higher-order #synthesis: High level synthesis of higher order continuous time state variable filters with minimum sensitivity and hardware count (SP, SK, CAM, AP), pp. 1203–1204.
DATE-2006-VanderperrenD #matlab #uml: From UML/SysML to Matlab/Simulink: current state and future perspectives (YV, WD), p. 93.
DATE-DF-2006-HabibiMT #finite #generative #state machine: Generating finite state machines from SystemC (AH, HM, ST), pp. 76–81.
SIGMOD-2006-DoanRV #information management #research #state of the art: Managing information extraction: state of the art and research directions (AD, RR, SV), pp. 799–800.
SIGMOD-2006-LiuZR #memory management #query #runtime: Run-time operator state spilling for memory intensive long-running queries (BL, YZ, EAR), pp. 347–358.
VLDB-2006-ShegalovW #named #php: EOS2: Unstoppable Stateful PHP (GS, GW), pp. 1223–1226.
VLDB-2006-WangRGB #multi #named #optimisation #paradigm #query: State-Slice: New Paradigm of Multi-query Optimization of Window-based Stream Queries (SW, EAR, SG, SB), pp. 619–630.
ITiCSE-2006-Bozic #algorithm #automaton #finite #modelling: Application of finite state automata to the bakery algorithm in critical section modeling (VB), p. 362.
FASE-2006-BergJR #parametricity #state machine: Regular Inference for State Machines with Parameters (TB, BJ, HR), pp. 107–121.
TACAS-2006-GaravelMBCDJSS #distributed #generative #tool support: DISTRIBUTOR and BCG_MERGE: Tools for Distributed Explicit State Space Generation (HG, RM, DB, AC, ND, CJ, ISS, GS), pp. 445–449.
STOC-2006-GavinskyKRW #bound #communication #complexity #exponential #identification #quantum: Bounded-error quantum state identification and exponential separations in communication complexity (DG, JK, OR, RdW), pp. 594–603.
STOC-2006-HallgrenMRRS #graph #morphism #quantum: Limitations of quantum coset states for graph isomorphism (SH, CM, MR, AR, PS), pp. 604–617.
FLOPS-2006-IgnatoffCK #adaptation #framework #functional #object-oriented: Crossing State Lines: Adapting Object-Oriented Frameworks to Functional Reactive Languages (DI, GHC, SK), pp. 259–276.
CIAA-2006-ConstantM #automaton #compilation #constraints #finite: Compiling Linguistic Constraints into Finite State Automata (MC, DM), pp. 242–252.
CIAA-2006-Fernando #finite: Finite-State Temporal Projection (TF), pp. 230–241.
CIAA-2006-Yu #complexity #on the: On the State Complexity of Combined Operations (SY), pp. 11–22.
DLT-2006-GruberH #bound #complexity #nondeterminism: Finding Lower Bounds for Nondeterministic State Complexity Is Hard (HG, MH), pp. 363–374.
DLT-2006-GurevichW #question #state machine: Can Abstract State Machines Be Useful in Language Theory? (YG, CW), pp. 14–19.
ICALP-v1-2006-DotyLN #finite: Finite-State Dimension and Real Arithmetic (DD, JHL, SN), pp. 537–547.
SEFM-2006-RodriguesBCFG #approach #using: A Bag-of-Tasks Approach for State Space Exploration Using Computational Grids (CLR, PESB, JMC, JCAdF, DSG), pp. 226–235.
CHI-2006-GrossmanHBAB #using: Hover widgets: using the tracking state to extend the capabilities of pen-operated devices (TG, KH, PB, MA, RB), pp. 861–870.
SOFTVIS-2006-TanimotoL #interface #source code: A transparent interface to state-space search programs (SLT, SL), pp. 151–152.
CAiSE-2006-LapouchnianL #modelling #requirements: Modeling Mental States in Agent-Oriented Requirements Engineering (AL, YL), pp. 480–494.
ICEIS-ISAS-2006-CruzLW #contract #specification #visual notation: Visual Contracts — A Way to Reason about States and Cardinalities in IT System Specifications (JDDlC, LSL, AW), pp. 298–303.
ICEIS-SAIC-2006-CampeloS #industrial: The State of E-Business on the German Electronic Consumer Goods Industry (EGC, WS), pp. 69–74.
ICML-2006-BowlingMJNW #learning #policy #predict #using: Learning predictive state representations using non-blind policies (MHB, PM, MJ, JN, DFW), pp. 129–136.
ICML-2006-HolmesJ: Looping suffix tree-based inference of partially observable hidden state (MPH, CLIJ), pp. 409–416.
ICML-2006-ToussaintS #markov #probability #process: Probabilistic inference for solving discrete and continuous state Markov Decision Processes (MT, AJS), pp. 945–952.
ICML-2006-WolfeS #predict: Predictive state representations with options (BW, SPS), pp. 1025–1032.
ICPR-v1-2006-TongWZJ #multi #using: Facial Feature Tracking using a Multi-State Hierarchical Shape Model under Varying Face Pose and Facial Expression (YT, YW, ZZ, QJ), pp. 283–286.
ICPR-v2-2006-BenouarethES #recognition #word: HMMs with Explicit State Duration Applied to Handwritten Arabic Word Recognition (AB, AE, MS), pp. 897–900.
ICPR-v2-2006-LiA #estimation #predict: Texture-Constrained Shape Prediction for Mouth Contour Extraction and its State Estimation (ZL, HA), pp. 88–91.
KR-2006-SardinaGLL #nondeterminism #on the #strict: On the Limits of Planning over Belief States under Strict Uncertainty (SS, GDG, YL, HJL), pp. 463–471.
SEKE-2006-FabresseDH #component: Unanticipated Connection of Components Based on Their State Changes Notifications (LF, CD, MH), pp. 702–707.
SEKE-2006-OgataKF #bound: Falsification of OTSs by Searches of Bounded Reachable State Spaces (KO, WK, KF), pp. 440–445.
MoDELS-2006-TaleghaniA #semantics #uml: Semantic Variations Among UML StateMachines (AT, JMA), pp. 245–259.
MoDELS-2006-TaleghaniA #semantics #uml: Semantic Variations Among UML StateMachines (AT, JMA), pp. 245–259.
RE-2006-WhittleJ #case study #generative #state machine: Generating Hierarchical State Machines from Use Case Charts (JW, PKJ), pp. 16–25.
SAC-2006-BreedenM #internet: Investigating “Internet Crimes Against Children” (ICAC) cases in the state of Florida (BB, JM), pp. 288–292.
SAC-2006-FekihAM #diagrams #specification #state machine #uml: Transformation of B specifications into UML class diagrams and state machines (HF, LJBA, SM), pp. 1840–1844.
FSE-2006-DamasLL #state machine #synthesis: Scenarios, goals, and state machines: a win-win partnership for model synthesis (CD, BL, AvL), pp. 197–207.
ICSE-2006-BasiliE #empirical #maturity #research #state of the art: Empirically driven SE research: state of the art and required maturity (VRB, SGE), p. 32.
ICSE-2006-TanAC #finite #verification: Managing space for finite-state verification (JT, GSA, LAC), pp. 152–161.
ICSE-2006-XieMY #automation #state machine: Automatic extraction of abstract-object-state machines from unit-test executions (TX, EM, HY), pp. 835–838.
LCTES-2006-ProchnowTH #state machine: Synthesizing safe state machines from Esterel (SP, CT, RvH), pp. 113–124.
OSDI-2006-VerbowskiKKDLLWR #interactive #monitoring: Flight Data Recorder: Monitoring Persistent-State Interactions to Improve Systems Management (CV, EK, AK, BD, SL, JL, YMW, RR), pp. 117–130.
AMOST-J-2005-Robinson-MallettLMG06 #identification #model checking #using #verification: Extended state identification and verification using a model checker (CRM, PL, TM, UG), pp. 981–992.
CSL-2006-ChadhaMS #probability #reasoning #source code: Reasoning About States of Probabilistic Sequential Programs (RC, PM, AS), pp. 240–255.
CSL-2006-GollerL #infinity #logic #model checking: Infinite State Model-Checking of Propositional Dynamic Logics (SG, ML), pp. 349–364.
FATES-RV-2006-KrichenT #finite #identification #problem #transducer: State-Identification Problems for Finite-State Transducers (MK, ST), pp. 148–162.
ISSTA-2006-Hamlet #testing: Subdomain testing of units and systems with state (DH), pp. 85–96.
ISSTA-2006-VisserPP #generative #java #using: Test input generation for java containers using state matching (WV, CSP, RP), pp. 37–48.
LICS-2006-Bryant #infinity #using #verification: Formal Verification of Infinite State Systems Using Boolean Methods (REB), pp. 3–4.
RTA-2006-Bryant #infinity #using #verification: Formal Verification of Infinite State Systems Using Boolean Methods (REB), pp. 1–3.
TestCom-2006-Ipate #bound #finite #nondeterminism #sequence #state machine #testing: Bounded Sequence Testing from Non-deterministic Finite State Machines (FI), pp. 55–70.
TestCom-2006-KeumKKBC #finite #generative #state machine #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 #state machine #verification: Verification of Well-Formed Communicating Recursive State Machines (LB, SLT, AP), pp. 412–426.
CBSE-2005-GrunskeKP #component #evaluation #modelling #safety: Model-Driven Safety Evaluation with State-Event-Based Component Failure Annotations (LG, BK, YP), pp. 33–48.
CASE-2005-Hwang #approach #automation #behaviour #configuration management #finite #generative: Generating finite-state global behavior of reconfigurable automation systems: DEVS approach (MHH), pp. 254–260.
CASE-2005-LeeP #analysis #constraints #graph: Steady state analysis of a timed event graph with time window constraints (TEL, SHP), pp. 404–409.
DATE-2005-CabodiCNQ #bound #model checking #quantifier #set: Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking (GC, MC, SN, SQ), pp. 688–689.
ITiCSE-2005-KollingH #game studies #programming: Game programming in introductory courses with direct state manipulation (MK, PH), pp. 59–63.
FASE-2005-ReussnerHH #component #contract #graph grammar #modelling #parametricity: Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars (RHR, JH, AH), pp. 80–95.
FoSSaCS-2005-AbbesB #branch #probability: Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications (SA, AB), pp. 95–109.
FoSSaCS-2005-CattaniSKN #nondeterminism #probability: Stochastic Transition Systems for Continuous State Spaces and Non-determinism (SC, RS, MZK, GN), pp. 125–139.
FoSSaCS-2005-DengP #axiom #behaviour #finite #probability: Axiomatizations for Probabilistic Finite-State Behaviors (YD, CP), pp. 110–124.
TACAS-2005-AlurCEM #detection #on the fly #reachability #recursion #state machine: On-the-Fly Reachability and Cycle Detection for Recursive State Machines (RA, SC, KE, PM), pp. 61–76.
TACAS-2005-BinghamH #empirical #infinity #performance #verification: Empirically Efficient Verification for a Class of Infinite-State Systems (JDB, AJH), pp. 77–92.
TACAS-2005-EtessamiY #algorithm #probability #recursion #state machine #verification: Algorithmic Verification of Recursive Probabilistic State Machines (KE, MY), pp. 253–270.
TACAS-2005-RemkeHC #infinity #markov #model checking: Model Checking Infinite-State Markov Chains (AR, BRH, LC), pp. 237–252.
IWPC-2005-Reiss05a #concurrent #java #monitoring #performance #thread: Efficient Monitoring and Display of Thread State in Java (SPR), pp. 247–256.
PASTE-2005-Hamlet #formal method #invariant #testing: Invariants and state in testing and formal methods (DH), pp. 48–51.
PLDI-2005-KrishnaswamiA #encapsulation #higher-order: Permission-based ownership: encapsulating state in higher-order typed languages (NRK, JA), pp. 96–106.
CIAA-J-2004-ChamparnaudCP05: Brute force determinization of nfas by means of state covers (JMC, FC, TP), pp. 441–451.
CIAA-J-2004-JirasekJS05 #complexity: State complexity of concatenation and complementation (JJ, GJ, AS), pp. 511–529.
CIAA-J-2004-KrawetzLS05 #complexity #finite #monad #set: State complexity and the monoid of transformations of a finite set (BK, JL, JS), pp. 547–563.
CIAA-2005-HanW #automaton #finite #regular expression: Shorter Regular Expressions from Finite-State Automata (YSH, DW), pp. 141–152.
CIAA-2005-SubramanianS #automaton #documentation #finite #recursion #using #xml: Compressing XML Documents Using Recursive Finite State Automata (HS, PS), pp. 282–293.
CIAA-2005-VielhaberC #infinity #on the #set #transducer: On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set (MV, MdPCC), pp. 356–357.
IFM-2005-ChakiCGOSTV #specification #verification: State/Event Software Verification for Branching-Time Specifications (SC, EMC, OG, JO, NS, TT, HV), pp. 53–69.
IFM-2005-SenguptaC #framework #state machine: An Integrated Framework for Scenarios and State Machines (BS, RC), pp. 366–385.
ICFP-2005-AhmedFM: A step-indexed model of substructural state (AJA, MF, GM), pp. 78–91.
ICML-2005-SiddiqiM #learning #performance: Fast inference and learning in large-state-space HMMs (SMS, AWM), pp. 800–807.
ICML-2005-WolfeJS #learning #predict: Learning predictive state representations in dynamical systems without reset (BW, MRJ, SPS), pp. 980–987.
SEKE-2005-Hazeyama #bibliography #re-engineering: State of the Survey on Team-based Software Engineering Project Course (AH), pp. 430–435.
SEKE-2005-Wang #infinity #logic #model checking #specification: Specification of an Infinite-State Local Model Checker in Rewriting Logic (BYW), pp. 442–447.
SEKE-2005-XuXN #approach #aspect-oriented #source code #testing: A State-Based Approach to Testing Aspect-Oriented Programs (DX, WX, KEN), pp. 366–371.
MoDELS-2005-Cruz-LemusGMP #diagrams #statechart #uml: Evaluating the Effect of Composite States on the Understandability of UML Statechart Diagrams (JACL, MG, MEM, MP), pp. 113–125.
MoDELS-2005-Cruz-LemusGMP #diagrams #statechart #uml: Evaluating the Effect of Composite States on the Understandability of UML Statechart Diagrams (JACL, MG, MEM, MP), pp. 113–125.
ECOOP-2005-BanerjeeN #encapsulation: State Based Ownership, Reentrance, and Encapsulation (AB, DAN), pp. 387–411.
PADL-2005-ZhuX #pointer #programming: Safe Programming with Pointers Through Stateful Views (DZ, HX), pp. 83–97.
POPL-2005-FieldV #consistency #distributed #maintenance #named #programming: Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments (JF, CAV), pp. 195–208.
ICSE-2005-Littlewood #assessment #dependence #state of the art: Dependability assessment of software-based systems: state of the art (BL), pp. 6–7.
HPDC-2005-HumphreyWJBRGBLFMPM #comparison #framework #implementation #web #web service: State and events for Web services: a comparison of five WS-resource framework and WS-notification implementations (MH, GSW, KRJ, JB, MR, JG, JB, SL, ITF, SM, SP, MM), pp. 3–13.
SAT-J-2004-TangYRM05 #algorithm #analysis #problem #quantifier #satisfiability: Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 292–305.
CADE-2005-KonevWZ #logic #transitive: Temporal Logics over Transitive States (BK, FW, MZ), pp. 182–203.
CAV-2005-VecchieS #source code: Syntax-Driven Reachable State Space Construction of Synchronous Reactive Programs (EV, RdS), pp. 213–225.
TestCom-2005-KrichenT #automaton #identification #problem: State Identification Problems for Timed Automata (MK, ST), pp. 175–191.
DAC-2004-KapoorJ #concurrent #logic #specification #synthesis: Decomposing specifications with concurrent outputs to resolve state coding conflicts in asynchronous logic synthesis (HKK, MBJ), pp. 830–833.
DAC-2004-ParkCYC #power management #testing: A new state assignment technique for testing and low power (SP, SC, SY, MJC), pp. 510–513.
DAC-2004-Pomeranz #functional #generative #on the #testing: On the generation of scan-based test sets with reachable states for testing under functional operation conditions (IP), pp. 928–933.
DATE-v1-2004-LeeDBS #power management: Simultaneous State, Vt and Tox Assignment for Total Standby Power Minimization (DL, HD, DB, DS), pp. 494–499.
DATE-v1-2004-LiPZSSS: State-Preserving vs. Non-State-Preserving Leakage Control in Caches (YL, DP, YZ, KS, MRS, KS), pp. 22–29.
DATE-v2-2004-TiwariT #embedded #finite #memory management #state machine: Saving Power by Mapping Finite-State Machines into Embedded Memory Blocks in FPGAs (AT, KAT), pp. 916–921.
DATE-v2-2004-ZhouZLLZC #analysis #using: Steady-State Analysis of Nonlinear Circuits Using Discrete Singular Convolution Method (XZ, DZ, JL, RL, XZ, CC), pp. 1322–1326.
SIGMOD-2004-RosenthalW #research #scalability #security #state of the art: Security of Shared Data in Large Systems: State of the Art and Research Directions (AR, MW), pp. 962–964.
VLDB-2004-RosenthalW #research #scalability #security #state of the art: Security of Shared Data in Large Systems: State of the Art and Research Directions (AR, MW), p. 1242.
TACAS-2004-BeauquierCP #automation #first-order #logic #parametricity #protocol #state machine #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.
ICSM-2004-WillmorES #database #slicing: Program Slicing in the Presence of a Database State (DW, SME, JS), pp. 448–452.
IWPC-2004-KorelT #comprehension #modelling: Understanding Modifications in State-Based Models (BK, LHT), pp. 246–250.
CIAA-2004-BerstelC #algorithm #complexity #on the: On the Complexity of Hopcroft’s State Minimization Algorithm (JB, OC), pp. 35–44.
CIAA-2004-ChamparnaudCP: Brute Force Determinization of NFAs by Means of State Covers (JMC, FC, TP), pp. 80–89.
CIAA-2004-DebskiF #state machine: Concatenation State Machines and Simple Functions (WD, WF), pp. 113–124.
CIAA-2004-Egri-NagyN #algebra #automaton #comparison #composition #finite #implementation: Algebraic Hierarchical Decomposition of Finite State Automata: Comparison of Implementations for Krohn-Rhodes Theory (AEN, CLN), pp. 315–316.
CIAA-2004-FerroOG #fault #finite: Regional Finite-State Error Repair (MVF, JO, JGG), pp. 269–280.
CIAA-2004-Ibarra #infinity: Automata-Theoretic Techniques for Analyzing Infinite-State Systems (OHI), p. 1.
CIAA-2004-JirasekJS #complexity #regular expression: State Complexity of Concatenation and Complementation of Regular Languages (JJ, GJ, AS), pp. 178–189.
CIAA-2004-KrawetzLS #complexity #finite #monad #set: State Complexity and the Monoid of Transformations of a Finite Set (BK, JL, JS), pp. 213–224.
IFM-2004-ChakiCOSS #model checking: State/Event-Based Software Model Checking (SC, EMC, JO, NS, NS), pp. 128–147.
SEFM-2004-SchuleS #comparison #infinity #model checking #verification: Global vs. Local Model Checking: A Comparison of Verification Techniques for Infinite State Systems (TS, KS), pp. 67–76.
ICEIS-v3-2004-McNeileS #behaviour #mixin #modelling #state machine: Mixin Based Behaviour Modelling — An Example Based on Composed State Machines (ATM, NS), pp. 179–183.
ICML-2004-JamesS #learning #predict: Learning and discovery of predictive state representations in dynamical systems with reset (MRJ, SPS).
ICPR-v3-2004-NishiF #analysis #using #video: Object-Based Video Coding Using Pixel State Analysis (TN, HF), pp. 306–309.
ICPR-v4-2004-ZajdelCK #multi #online: Online Multicamera Tracking with a Switching State-Space Model (WZ, ATC, BJAK), pp. 339–343.
ICPR-v4-2004-ZhaiRS #detection #finite #state machine #using: Conversation Detection in Feature Films Using Finite State Machines (YZ, ZR, MS), pp. 458–461.
KDD-2004-DasMS: Belief state approaches to signaling alarms in surveillance systems (KD, AWM, JGS), pp. 539–544.
KR-2004-Lin #invariant: Discovering State Invariants (FL), pp. 536–544.
SAC-J-2003-BorgerCR04 #formal method #on the #state machine #uml #using: On formalizing UML state machines using ASM (EB, AC, ER), pp. 287–292.
ICSE-2004-KhareT #architecture #distributed #rest: Extending the Representational State Transfer (REST) Architectural Style for Decentralized Systems (RK, RNT), pp. 428–437.
OSDI-2004-CohenCGKS #automation #correlation: Correlating Instrumentation Data to System States: A Building Block for Automated Diagnosis and Control (IC, JSC, MG, TK, JS), pp. 231–244.
CAV-2004-FinkelL #image #infinity #model checking: Image Computation in Infinite State Model Checking (AF, JL), pp. 361–371.
CAV-2004-PitermanV #infinity #model checking: Global Model-Checking of Infinite-State Systems (NP, MYV), pp. 387–400.
LICS-2004-NaumannB #imperative #invariant #reasoning #towards: Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State (DAN, MB), pp. 313–323.
SAT-2004-TangYRM #algorithm #analysis #problem #quantifier #satisfiability: Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 214–223.
DAC-2003-BergamaschiJ #analysis: State-based power analysis for systems-on-chip (RAB, YJ), pp. 638–641.
DAC-2003-JayakumarPS #estimation: Dos and don’ts of CTL state coverage estimation (NJ, MP, FS), pp. 292–295.
DAC-2003-LeeB #reduction: Static leakage reduction through simultaneous threshold voltage and state assignment (DL, DB), pp. 191–194.
DATE-2003-DrineasM #concurrent #detection #fault #monitoring: Non-Intrusive Concurrent Error Detection in FSMs through State/Output Compaction and Monitoring via Parity Trees (PD, YM), pp. 11164–11167.
DATE-2003-LeeHH #composition #design #finite #power management #state machine: Decomposition of Extended Finite State Machine for Low Power Design (ML, TH, SYH), pp. 11152–11153.
DATE-2003-LogothetisS #analysis #source code: Exact High Level WCET Analysis of Synchronous Programs by Symbolic State Space Exploration (GL, KS), pp. 10196–10203.
DATE-2003-LomenaLWK #approach #explosion #performance #scheduling: An Efficient Hash Table Based Approach to Avoid State Space Explosion in History Driven Quasi-Static Scheduling (AGL, MLLV, YW, AK), pp. 10428–10435.
DATE-2003-WedlerSK #encoding #induction #using: Using RTL Statespace Information and State Encoding for Induction Based Property Checking (MW, DS, WK), pp. 11156–11157.
ICDAR-2003-GunterB #optimisation #word: Optimizing the Number of States, Training Iterations and Gaussians in an HMM-based Handwritten Word Recognizer (SG, HB), pp. 472–476.
ICDAR-2003-SuenMKL #analysis #recognition #state of the art: Analysis and Recognition of Asian Scripts — the State of the Art (CYS, SM, SHK, CHL), p. 866–?.
ITiCSE-2003-DannDCDRP #behaviour #named #visualisation: Objects: visualization of behavior and state (WD, TD, SC, KD, KR, RP), pp. 84–88.
FASE-2003-AttiogbePS #data type #diagrams #integration: Integration of Formal Datatypes within State Diagrams (CA, PP, GS), pp. 341–355.
FASE-2003-TenzerS #diagrams #modelling #recursion #uml: Modelling Recursive Calls with UML State Diagrams (JT, PS), pp. 135–149.
TACAS-2003-BerthomieuV #analysis #branch #petri net: State Class Constructions for Branching Analysis of Time Petri Nets (BB, FV), pp. 442–457.
TACAS-2003-GrooteH #scalability #visualisation: Large State Space Visualization (JFG, FvH), pp. 585–590.
TACAS-2003-Schmidt #invariant #petri net #using: Using Petri Net Invariants in State Space Construction (KS0), pp. 473–488.
TACAS-2003-StollerC #reduction: Optimistic Synchronization-Based State-Space Reduction (SDS, EC), pp. 489–504.
ICSM-2003-KorelSTV #modelling #slicing: Slicing of State-Based Models (BK, IS, LHT, BV), pp. 34–43.
STOC-2003-AharonovT #generative #quantum #statistics: Adiabatic quantum state generation and statistical zero knowledge (DA, ATS), pp. 20–29.
CIAA-2003-KellyC #finite #state machine: Computational Linguistic Motivations for a Finite-State Machine Hierarchy (RK, JCB), pp. 301–303.
CIAA-2003-KempeBGGN #compilation #finite #named: WFSC — A New Weighted Finite State Compiler (AK, CB, TG, FG, FN), pp. 108–119.
CIAA-2003-UnoldTDT #finite: Finite-State Molecular Computing (OU, MT, TD, AT), pp. 309–310.
CIAA-2003-WallmeierHT #finite #specification #synthesis: Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications (NW, PH, WT), pp. 11–22.
ICALP-2003-TorreNPP #recursion #state machine: Hierarchical and Recursive State Machines with Context-Dependent Properties (SLT, MN, MP, GP), pp. 776–789.
ICALP-2003-XieDI #equation #infinity #polynomial #verification: A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems (GX, ZD, OHI), pp. 668–680.
FME-2003-KuhnO #state machine: Interacting State Machines for Mobility (TAK, DvO), pp. 698–718.
FME-2003-Lettrari #abstraction #heuristic #object-oriented #using: Using Abstractions for Heuristic State Space Exploration of Reactive Object-Oriented Systems (ML), pp. 462–481.
SEFM-2003-NgB #csp #diagrams #formal method #towards #uml: Towards Formalizing UML State Diagrams in CSP (MYN, MJB), p. 138–?.
AGTIVE-2003-Rensink #generative: The GROOVE Simulator: A Tool for State Space Generation (AR), pp. 479–485.
VISSOFT-2003-EichelbergerG #diagrams #layout #state of the art #uml: UML Class Diagrams – State of the Art in Layout Techniques (HE, JWvG), pp. 30–34.
ICML-2003-KakadeKL #metric: Exploration in Metric State Spaces (SK, MJK, JL), pp. 306–312.
ICML-2003-SebbanJ #approach #grammar inference #on the #semistructured data #statistics: On State Merging in Grammatical Inference: A Statistical Approach for Dealing with Noisy Data (MS, JCJ), pp. 688–695.
ICML-2003-SinghLJPS #learning #predict: Learning Predictive State Representations (SPS, MLL, NKJ, DP, PS), pp. 712–719.
SEKE-2003-FlakeM #constraints #ocl #semantics: Semantics of State-Oriented Expressions in the Object Constraint Language (SF, WM), pp. 142–149.
PPDP-2003-Nanevski: From dynamic binding to state via modal possibility (AN), pp. 207–218.
RE-2003-ShihL #requirements: Acquiring and Incorporating State-Dependent Timing Requirements (CSS, JWSL), pp. 87–94.
SAC-2003-BorgerRC #concurrent #modelling #state machine #uml: Modeling the Meaning of Transitions from and to Concurrent States in UML State Machines (EB, ER, AC), pp. 1086–1091.
SAC-2003-GeorgousopoulosR #mobile #modelling: Combining State and Model-based Approaches for Mobile Agent Load Balancing (CG, OFR), pp. 878–885.
CC-2003-JohnsonM #dependence #graph #using: Combined Code Motion and Register Allocation Using the Value State Dependence Graph (NJ, AM), pp. 1–16.
HPCA-2003-GarzaranPLVRT #concurrent #memory management #multi #thread #trade-off: Tradeoffs in Buffering Memory State for Thread-Level Speculation in Multiprocessors (MJG, MP, JML, VV, LR, JT), pp. 191–202.
HPCA-2003-Kogge: The State of State (PMK), p. 266.
PPoPP-2003-ChenTSDS #distributed: Exploiting high-level coherence information to optimize distributed shared state (DC, CT, BS, SD, MLS), pp. 131–142.
CAV-2003-BartzisB #image #infinity #model checking #performance: Efficient Image Computation in Infinite State Model Checking (CB, TB), pp. 249–261.
CAV-2003-RosuVWL #estimation #source code: Certifying Optimality of State Estimation Programs (GR, RPV, JW, LL), pp. 301–314.
CSL-2003-Bouajjani #infinity #tutorial #verification: Verification of Infinite State Systems (Tutorial) (AB), p. 71.
CSL-2003-RybinaV #infinity #model checking #performance: Fast Infinite-State Model Checking in Integer-Based Systems (Invited Lecture) (TR, AV), pp. 546–573.
ICLP-2003-DelzannoGM #composition #infinity #verification: Compositional Verification of Infinite State Systems (GD, MG, MCM), pp. 47–48.
SAT-2003-FrancoKSWWDV #named #satisfiability: SBSAT: a State-Based, BDD-Based Satisfiability Solver (JVF, MK, JSS, JW, SW, MD, WMV), pp. 398–410.
TestCom-2003-El-FakihPYB #fault #finite #state machine: Fault Diagnosis in Extended Finite State Machines (KEF, SP, NY, GvB), pp. 197–210.
CBSE-2002-LiuR #component #specification: Specifying Component Method Properties for Component State Recovery in RAIC (CL, DJR), p. 9.
ASE-2002-OwenMC #finite #modelling #question #what: What Makes Finite-State Models More (or Less) Testable? (DO, TM, BC), pp. 237–240.
DAC-2002-BertaccoO #performance #representation #simulation: Efficient state representation for symbolic simulation (VB, KO), pp. 99–104.
DAC-2002-Roychowdhury: A time-domain RF steady-state method for closely spaced tones (JSR), pp. 510–513.
DAC-2002-YangP #component #multi #simulation #using: Time-domain steady-state simulation of frequency-dependent components using multi-interval Chebyshev method (BY, JRP), pp. 504–509.
DATE-2002-BrachtendorfLLMF #continuation #using: Steady State Calculation of Oscillators Using Continuation Methods (HGB, SL, RL, RCM, PF), p. 1139.
DATE-2002-GorenF #finite #heuristic #named #reduction #state machine: CHESMIN: A Heuristic for State Reduction in Incompletely Specified Finite State Machines (SG, FJF), pp. 248–254.
DATE-2002-IraniGS #analysis #multi #power management: Competitive Analysis of Dynamic Power Management Strategies for Systems with Multiple Power Savings States (SI, RKG, SKS), pp. 117–123.
DATE-2002-KhomenkoKY #detection #integer #programming #using: Detecting State Coding Conflicts in STGs Using Integer Programming (VK, MK, AY), pp. 338–345.
DATE-2002-TeichK #configuration management #finite #implementation #self #state machine: (Self-)reconfigurable Finite State Machines: Theory and Implementation (JT, MK), pp. 559–566.
VLDB-2002-MahnkeMS: Extending an ORDBMS: The StateMachine Module (WM, CM, HPS), pp. 1079–1082.
ITiCSE-2002-CasselK #architecture: A state of the course report: computer organization & architecture (L(C, DK), pp. 175–177.
FASE-2002-XieB #design #execution #model checking #object-oriented #reduction: Integrated State Space Reduction for Model Checking Executable Object-Oriented Software System Designs (FX, JCB), pp. 64–79.
TACAS-2002-GodefroidK #algorithm #scalability #search-based #using: Exploring Very Large State Spaces Using Genetic Algorithms (PG, SK), pp. 266–280.
ICSM-2002-ZouK #approach #migration #object-oriented: Migration to Object Oriented Platforms: A State Transformation Approach (YZ, KK), pp. 530–539.
IWPC-2002-SomeL #comprehension #modelling: Enhancing Program Comprehension with Recovered State Models (SSS, TCL), pp. 85–93.
PASTE-2002-SutherlandGS #thread: The code of many colors: relating threads to code and shared state (DFS, AG, WLS), pp. 77–83.
WCRE-2002-KollmanSSSZ #case study #reverse engineering #state of the art #uml: A Study on the Current State of the Art in Tool-Supported UML-Based Static Reverse Engineering (RK, PS, ES, TS, AZ), p. 22–?.
SAS-2002-GiacobazziR #abstract interpretation #model checking: States vs. Traces in Model Checking by Abstract Interpretation (RG, FR), pp. 461–476.
CIAA-J-2000-HarelK02 #object-oriented #specification: Synthesizing State-Based Object Systems from LSC Specifications (DH, HK), pp. 5–51.
CIAA-J-2000-PighizziniS02 #complexity: Unary Language Operations, State Complexity and Jacobsthal’s Function (GP, JS), pp. 145–159.
CIAA-2002-Daciuk #algorithm #automaton #comparison #finite #set #string: Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings (JD), pp. 255–261.
CIAA-2002-GranaAV #compilation #constraints #finite #transducer: Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers (JG, GA, JV), pp. 128–137.
CIAA-2002-GuingneN #finite #lazy evaluation: Finite State Lazy Operations in NLP (FG, FN), pp. 138–147.
CIAA-2002-HolzerK #automaton #complexity #finite #nondeterminism: State Complexity of Basic Operations on Nondeterministic Finite Automata (MH, MK), pp. 148–157.
DLT-2002-HolzerK #complexity #nondeterminism: Unary Language Operations and Their Nondeterministic State Complexity (MH, MK), pp. 162–172.
ICALP-2002-GenestMSZ #infinity #model checking: Infinite-State High-Level MSCs: Model-Checking and Realizability (BG, AM, HS, MZ), pp. 657–668.
IFM-2002-KuskeGKK #diagrams #graph transformation #semantics #uml: An Integrated Semantics for UML Class, Object and State Diagrams Based on Graph Transformation (SK, MG, RK, HJK), pp. 11–28.
IFM-2002-LedangS #modelling #uml: Contributions for Modelling UML State-Charts in B (HL, JS), pp. 109–127.
CAiSE-2002-MohanCS #approach #development #process #state machine: A State Machine Based Approach for a Process Driven Development of Web-Applications (RM, MAC, JS), pp. 52–66.
ICEIS-2002-ShinkawaM #database #design #transaction: State-Sensitive Design of Database Transactions (YS, MJM), pp. 282–289.
ICEIS-2002-ViaeneBDVP #pattern matching #pattern recognition #proving #recognition #state of the art: Proof Running Two State-Of-The-Art Pattern Recognition Techniques in the Field of Direct Marketing (SV, BB, GD, JV, DVdP), pp. 446–454.
ICML-2002-AberdeenB #scalability: Scalable Internal-State Policy-Gradient Methods for POMDPs (DA, JB), pp. 3–10.
ICPR-v1-2002-SuriWGSL #comparison #image #state of the art: A Comparison of State-of-the-Art Diffusion Imaging Techniques for Smoothing Medical/Non-Medical Image Data (JSS, DW, JG, SS, SL), p. 508–?.
SEKE-2002-LeeKC #finite #interactive #sequence chart #state machine #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 #state machine #tool support: Scenarios and state machines: models, algorithms, and tools (SU, TS, AZ), pp. 659–660.
ICSE-2002-ZimmermanLL #readability #requirements #specification: Investigating the readability of state-based formal requirements specification languages (MKZ, KL, NGL), pp. 33–43.
CAV-2002-BlomP #confluence #proving #reduction: State Space Reduction by Proving Confluence (SB, JvdP), pp. 596–609.
CAV-2002-RybinaV #canonical #infinity #model checking #using: Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking (TR, AV), pp. 386–400.
ISSTA-2002-FriedmanHNS #state machine #testing: Projected state machine coverage for software testing (GF, AH, KN, TS), pp. 134–143.
ISSTA-2002-GrieskampGSV #finite #generative #state machine: Generating finite state machines from abstract state machines (WG, YG, WS, MV), pp. 112–122.
TestCom-2002-SerdarT #approach #finite #generative #sequence #state machine: A New Approach To Checking Sequence Generation for Finite State Machines (BS, KCT), p. 391–?.
ASE-2001-Iosif #model checking #symmetry: Exploiting Heap Symmetries in Explicit-State Model Checking of Software (RI), pp. 254–261.
ASE-2001-ShenCH #state machine #tool support #uml #validation: A UML Validation Toolset Based on Abstract State Machines (WS, KJC, JH), pp. 315–318.
ASE-2001-WhittleBSRPPOLB #deduction #estimation #named #synthesis: Amphion/NAV: Deductive Synthesis of State Estimation Software (JW, JVB, JS, PR, TP, JP, PO, MRL, GPB), pp. 395–399.
ICDAR-2001-MiledA #markov #modelling #recognition: Planar Markov Modeling for Arabic Writing Recognition: Advancement State (HM, NEBA), pp. 69–73.
VLDB-2001-DayalHL #coordination #process #roadmap #state of the art: Business Process Coordination: State of the Art, Trends, and Open Issues (UD, MH, RL), pp. 3–13.
ITiCSE-2001-CiesielskiM #algorithm #animation #learning #student #using: Using animation of state space algorithms to overcome student learning difficulties (VC, PM), pp. 97–100.
FASE-2001-BordeleauC #design #on the #state machine: On the Importance of Inter-scenario Relationships in Hierarchical State Machine Design (FB, JPC), pp. 156–170.
FASE-2001-HeckelS #collaboration #diagrams #uml: Strengthening UML Collaboration Diagrams by State Transformations (RH, SS), pp. 109–123.
TACAS-2001-Castillo #analysis #modelling #state machine #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.
TACAS-2001-ChristensenKM: A Sweep-Line Method for State Space Exploration (SC, LMK, TM), pp. 450–464.
TACAS-2001-CiardoLS #generative #named #performance: Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation (GC, GL, RS), pp. 328–342.
TACAS-2001-CimattiRB #automaton #model checking #set: Searching Powerset Automata by Combining Explicit-State and Symbolic Model Checking (AC, MR, PB), pp. 313–327.
ICSM-2001-Kajko-Mattsson #documentation #maintenance: The State of Documentation Practice within Corrective Maintenance (MKM), pp. 354–363.
CIAA-2001-AlegriaAEEU #finite #natural language #using: Using Finite State Technology in Natural Language Processing of Basque (IA, MJA, NE, AE, RU), pp. 1–12.
CIAA-2001-FriburgerM #finite #transducer: Finite-State Transducer Cascade to Extract Proper Names in Texts (NF, DM), pp. 115–124.
CIAA-2001-Gaal #finite #question #transducer: Is this Finite-State Transducer Sequentiable? (TG), pp. 125–134.
CIAA-2001-GranaBA #automaton #compilation #finite #scalability: Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries (JG, FMB, MAA), pp. 135–148.
CIAA-2001-Kempe #finite #transducer: Extraction of epsilon-Cyclesfrom Finite-State Transducers (AK), pp. 190–201.
CIAA-2001-Savary #finite #nearest neighbour: Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction (AS), pp. 251–260.
DLT-2001-KudlekR #turing machine: A Universal Turing Machine with 3 States and 9 Symbols (MK, YR), pp. 311–318.
ICALP-2001-BenediktGR #model checking #state machine #strict: Model Checking of Unrestricted Hierarchical State Machines (MB, PG, TWR), pp. 652–666.
ICALP-2001-Bouajjani #infinity #term rewriting #verification: Languages, Rewriting Systems, and Verification of Infinite-State Systems (AB), pp. 24–39.
ICALP-2001-DaiLLM #finite: Finite-State Dimension (JJD, JIL, JHL, EM), pp. 1028–1039.
ICALP-2001-EtessamiWS #automaton #game studies #reduction #simulation: Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata (KE, TW, RAS), pp. 694–707.
ICALP-2001-MuschollP #communication #finite #protocol #sequence chart: From Finite State Communication Protocols to High-Level Message Sequence Charts (AM, DP), pp. 720–731.
FME-2001-DerepasGP #distributed #explosion: Avoiding State Explosion for Distributed Systems with Timestamps (FD, PG, DP), pp. 119–134.
CHI-2001-TsukaharaW: Responding to subtle, fleeting changes in the user’s internal state (WT, NW), pp. 77–84.
SVIS-2001-DemetrescuFS #algorithm #question #specification #visualisation: Specifying Algorithm Visualizations: Interesting Events or State Mapping? (CD, IF, JTS), pp. 16–30.
SVIS-2001-WilhelmMS #algorithm #invariant #visualisation: Algorithm Explanation: Visualizing Abstract States and Invariants (RW, TM, RS), pp. 381–394.
AdaEurope-2001-Sanden #concurrent #design pattern #process #state machine: A Design Pattern for State Machines and Concurrent Activities (BS), pp. 203–214.
ICML-2001-GlickmanS #learning #memory management #policy #probability #search-based: Evolutionary Search, Stochastic Policies with Memory, and Reinforcement Learning with Hidden State (MRG, KPS), pp. 194–201.
UML-2001-Kuske #graph transformation #semantics #state machine #uml: A Formal Semantics of UML State Machines Based on Structured Graph Transformation (SK), pp. 241–256.
TOOLS-USA-2001-Farr #convergence #industrial #video: State of the Industry: Converging Voice, Video and Data (LF), pp. 5–6.
LOPSTR-2001-FioravantiPP #infinity #process #program transformation #set #using #verification: Verification of Sets of Infinite State Processes Using Program Transformation (FF, AP, MP), pp. 111–128.
PPDP-2001-Naumann #imperative #modelling #programming #relational: Ideal Models for Pointwise Relational and State-Free Imperative Programming (DAN), pp. 4–15.
PADL-2001-Kaser #generative #model checking: State Generation in the PARMC Model Checker (OK), pp. 337–352.
RE-2001-JeffordsH #algorithm #invariant #requirements #specification: An Algorithm for Strengthening State Invariants Generated from Requirements Specifications (RDJ, CLH), pp. 182–193.
ESEC-FSE-2001-AbererH #concept #information management #modelling #peer-to-peer #state of the art: Peer-to-peer information systems: concepts and models, state-of-the-art, and future systems (KA, MH), pp. 326–327.
ICSE-2001-CobleighCO #algorithm #analysis #data flow #finite #verification: The Right Algorithm at the Right Time: Comparing Data Flow Analysis Algorithms for Finite State Verification (JMC, LAC, LJO), pp. 37–46.
ICSE-2001-Dong #diagrams #modelling: State, Event, Time and Diagram in System Modeling (JSD), pp. 733–734.
ICSE-2001-DwyerHJLPRZV #abstraction #finite #verification: Tool-Supported Program Abstraction for Finite-State Verification (MBD, JH, RJ, SL, CSP, R, HZ, WV), pp. 177–187.
CAV-2001-AlurEY #analysis #recursion #state machine: Analysis of Recursive State Machines (RA, KE, MY), pp. 207–220.
CAV-2001-DelzannoRB #explosion: Attacking Symbolic State Explosion (GD, JFR, LVB), pp. 298–310.
CAV-2001-Moore #execution #modelling #state machine #symbolic computation: Rewriting for Symbolic Execution of State Machine Models (JSM), pp. 411–422.
CSL-2001-StarkN #logic #state machine: A Logic for Abstract State Machines (RFS, SN), pp. 217–231.
LICS-2001-Gurevich #state machine: Logician in the Land of OS: Abstract State Machines in Microsoft (YG), pp. 129–136.
CBSE-2000-CrnkovicLL #component #re-engineering: State of the Practice: Component-Based Software Engineering Course (IC, ML, FL), p. 13.
DAC-2000-HettSB #distance #finite #state machine #traversal: Distance driven finite state machine traversal (AH, CS, BB), pp. 39–42.
DATE-2000-Maurer #logic #network #simulation #state machine #using: Logic Simulation Using Networks of State Machines (PMM), pp. 674–678.
DATE-2000-YalagandulaAS #automation #generative: Automatic Lighthouse Generation for Directed State Space Search (PY, AA, VS), pp. 237–242.
ESOP-2000-Thielecke #continuation #exception #on the: On Exceptions Versus Continuations in the Presence of State (HT), pp. 397–411.
FASE-2000-ReggioACH #approach #formal method #lightweight #state machine #uml: Analysing UML Active Classes and Associated State Machines — A Lightweight Formal Approach (GR, EA, CC, HH), pp. 127–146.
FoSSaCS-2000-LaroussinieS #bisimulation #equivalence #explosion #problem: The State Explosion Problem from Trace to Bisimulation Equivalence (FL, PS), pp. 192–207.
TACAS-2000-BodeveixF #infinity #named #validation: FMona: A Tool for Expressing Validation Techniques over Infinite State Systems (JPB, MF), pp. 204–219.
TACAS-2000-JonssonN #infinity #transitive #verification: Transitive Closures of Regular Relations for Verifying Infinite-State Systems (BJ, MN), pp. 220–234.
TACAS-2000-KrimmM #communication #composition #generative #partial order #reduction: Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems (JPK, LM), pp. 266–282.
STOC-2000-AmbainisSV: Computing with highly mixed states (extended abstract) (AA, LJS, UVV), pp. 697–704.
CIAA-2000-HarelK #object-oriented #specification: Synthesizing State-Based Object Systems from LSC Specifications (DH, HK), pp. 1–33.
CIAA-2000-Karttunen #finite #natural language #transducer: Applications of Finite-State Transducers in Natural Language Processing (LK), pp. 34–46.
CIAA-2000-Kempe #ambiguity #finite #transducer: Factorization of Ambiguous Finite-State Transducers (AK), pp. 170–181.
CIAA-2000-Pighizzini #complexity: Unary Language Concatenation and Its State Complexity (GP), pp. 252–262.
CIAA-2000-SchmitzV #algorithm #finite #game studies #implementation: Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games (DS, JV), pp. 263–271.
CIAA-2000-Shallit #complexity: State Complexity and Jacobsthal’s Function (JS), pp. 272–278.
CIAA-2000-Wareham #automaton #complexity #composition #finite #set: The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata (TW), pp. 302–310.
ICALP-2000-BravettiG #axiom #behaviour #congruence #finite: A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors (MB, RG), pp. 744–755.
ICALP-2000-MeenakshiR #finite #message passing #reasoning: Reasoning about Message Passing in Finite State Environments (BM, RR), pp. 487–498.
IFM-2000-BaumeisterZ: State-Based Extensions of CASL (HB, AVZ), pp. 3–24.
CAiSE-2000-BehrensR #behaviour #code generation #model transformation #named: StateLator — Behavioral Code Generation as an Instance of a Model Transformation (TB, SR), pp. 401–416.
ICML-2000-JuKS #classification #gesture: State-based Classification of Finger Gestures from Electromyographic Signals (PJ, LPK, YS), pp. 439–446.
ICPR-v3-2000-HongHT #finite #gesture #performance #recognition #state machine: Constructing Finite State Machines for Fast Gesture Recognition (PH, TSH, MT), pp. 3695–3698.
ICPR-v4-2000-CicirelliDD #recognition #visual notation: Visual State Recognition for a Target-Reaching Task (GC, TD, AD), pp. 4854–4857.
UML-2000-Padawitz #constraints #diagrams #how #proving #state machine #theorem proving #uml: Swinging UML: How to Make Class Diagrams and State Machines Amenable to Constraint Solving and Proving (PP), pp. 162–177.
TOOLS-EUROPE-2000-BouchenakH #java #thread: Pickling Threads State in the Java System (SB, DH), pp. 22–32.
TOOLS-USA-2000-HarelK #behaviour #inheritance #on the: On the Behavioral Inheritance of State-Based Objects (DH, OK), pp. 83–94.
ICSE-2000-CorbettDHLPRZ #finite #java #modelling #named #source code: Bandera: extracting finite-state models from Java source code (JCC, MBD, JH, SL, CSP, R, HZ), pp. 439–448.
ICSE-2000-DangK #approximate #infinity #model checking #realtime: Three approximation techniques for ASTRAL symbolic model checking of infinite state real-time systems (ZD, RAK), pp. 345–354.
ICSE-2000-KirschS #tutorial: Intellectual property protection for software in the United States and Europe (tutorial session): the changing roles of patents and copyrights (GJK, YS), p. 827.
ICSE-2000-Whalen #code generation: High-integrity code generation for state-based formalisms (MWW), pp. 725–727.
ICSE-2000-Widmaier #maturity #process #question #re-engineering #reliability #state of the art: Producing more reliable software: mature software engineering process vs. state-of-the-art technology? (JCW), pp. 88–93.
CAV-2000-AbdullaJ #infinity #tutorial #verification: Invited Tutorial: Verification of Infinite-State and Parameterized Systems (PAA, BJ), p. 4.
CAV-2000-KupfermanV #approach #infinity #reasoning: An Automata-Theoretic Approach to Reasoning about Infinite-State Systems (OK, MYV), pp. 36–52.
CAV-2000-Pnueli #abstraction #composition #deduction #explosion #symmetry: Keynote Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion (AP), p. 1.
CL-2000-BaralTTK #complexity: Computational Complexity of Planning Based on Partial Information about the System’s Present and Past States (CB, LCT, RT, VK), pp. 882–896.
CSL-2000-Schulte #state machine: Translating Theory into Practice — Abstract State Machines within Microsoft (WS), p. 71.
ISSTA-2000-Clarke #finite #validation #verification: Finite state verification: An emerging technology for validating software systems (abstract only) (LAC), p. 146.
LICS-2000-AbdullaN #infinity #performance #verification: Better is Better than Well: On Efficient Verification of Infinite-State Systems (PAA, AN), pp. 132–140.
DAC-1999-Bening #logic #simulation: A Two-State Methodology for RTL Logic Simulation (LB), pp. 672–677.
DAC-1999-GovindarajuDB #approximate #reachability #using: Improved Approximate Reachability Using Auxiliary State Variables (SGG, DLD, JPB), pp. 312–316.
DATE-1999-HongB #analysis #finite #reachability #scalability #state machine #using: Symbolic Reachability Analysis of Large Finite State Machines Using Don’t Cares (YH, PAB), p. 13–?.
DATE-1999-KallaC #equivalence #performance: Performance Driven Resynthesis by Exploiting Retiming-Induced State Register Equivalence (PK, MJC), pp. 638–642.
DATE-1999-KonijnenburgLG #generative #identification #testing: Illegal State Space Identification for Sequential Circuit Test Generation (MHK, JTvdL, AJvdG), pp. 741–746.
DATE-1999-NoethK #encoding #power management: Spanning Tree-based State Encoding for Low Power Dissipation (WN, RK), pp. 168–174.
DATE-1999-SantosJ #equivalence #on the fly: Exploiting State Equivalence on the Fly while Applying Code Motion and Speculation (LCVdS, JAGJ), p. 609–?.
DATE-1999-Sasaki #semantics #simulation #state machine: A Formal Semantics for Verilog-VHDL Simulation Interoperability by Abstact State Machine (HS), p. 353–?.
ICDAR-1999-KosmalaWR #clustering #online #recognition #scalability: Advanced State Clustering for Very Large Vocabulary HMM-based On-Line Handwriting Recognition (AK, DW, GR), pp. 442–445.
ICDAR-1999-MahadevanS #parsing #recognition: Parsing and Recognition of City, State, and ZIP Codes in Handwritten Addresses (UM, SNS), pp. 325–328.
ICDAR-1999-SuralD99a #documentation #image #markov: A Two-state Markov Chain Model of Degraded Document Images (SS, PKD), pp. 463–466.
CSEET-1999-WerthBMGTG #re-engineering: Software Engineering — The State of the Profession (LHW, DJB, NRM, FG, RT, DG), p. 114–?.
ITiCSE-1999-Taylor #education #implementation #standard #student: Implementing national educational technology standards for student in the United States (HGT), p. 200.
FASE-1999-GaudelKZ: Dynamic Systems with Implicit State (MCG, CK, AVZ), pp. 114–128.
FASE-1999-LopesF #using: Using Explicit State to Describe Architechtures (AL, JLF), pp. 144–160.
TACAS-1999-BehrmannLAHL #composition #reuse #using #verification: Verification of Hierarchical State/Event Systems Using Reusability and Compositionality (GB, KGL, HRA, HH, JLN), pp. 163–177.
TACAS-1999-BuchholzK #analysis #composition #distributed #tool support: Modular State Level Analysis of Distributed Systems Techniques and Tool Support (PB, PK), pp. 420–434.
TACAS-1999-MontanariP #finite #verification #π-calculus: Finite State Verification for the Asynchronous π-Calculus (UM, MP), pp. 255–269.
SAS-1999-BozgaFG #analysis #reduction: State Space Reduction Based on Live Variables Analysis (MB, JCF, LG), pp. 164–178.
STOC-1999-RazR #bound #on the: On Recycling the Randomness of States in Space Bounded Computation (RR, OR), pp. 159–168.
DLT-1999-JirickaK #automaton #finite #nondeterminism: Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata (PJ, JK), pp. 71–80.
ICALP-1999-AlurKY #communication #state machine: Communicating Hierarchical State Machines (RA, SK, MY), pp. 169–178.
ICALP-1999-EngelfrietH #finite #higher-order #logic #monad #transducer: Two-Way Finite State Transducers and Monadic Second-Order Logic (JE, HJH), pp. 311–320.
ICALP-1999-Hartmanis: Observations about the Nature and State of Computer Science (Keynote Address) (JH), p. 105.
WIA-1999-CampeanuCSY #complexity #finite: State Complexity of Basic Operations on Finite Languages (CC, KCI, KS, SY), pp. 60–70.
WIA-1999-Kiraz #finite #transducer: Compressed Storage of Sparse Finite-State Transducers (GAK), pp. 109–121.
WIA-1999-NoordG #compilation #finite #natural language #regular expression: An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing (GvN, DG), pp. 122–139.
WIA-1999-PaunT #finite #multi #transducer: Multiset Processing by Means of Systems of Finite State Transducers (GP, GT), pp. 140–157.
FM-v2-1999-GradelS #state machine: Logspace Reducibility via Abstract State Machines (EG, MS), pp. 1738–1757.
IFL-1999-AchtenP #implementation #interactive: The Implementation of Interactive Local State Transition Systems in Clean (PA, MJP), pp. 115–130.
HCI-EI-1999-Honold99a #development #state of the art #usability: Cross-cultural Usability Engineering: Development and State of the art (PH), pp. 1232–1236.
HCI-EI-1999-Strauss #specification #state of the art #user interface: Specification of the User Interface: State of the Art in Real Projects (FS), pp. 913–917.
SIGAda-1999-Balfour #corba: The current state of CORBA (invited presentation) (BB), p. 223.
EDOC-1999-AleksyST #component #middleware #state of the art: Interoperability and interchangeability of middleware components in a three-tier CORBA-environment-state of the art (MA, MS, CT), pp. 204–213.
UML-1999-PaltorL #formal method #model checking #state machine #uml: Formalising UML State Machines for Model Checking (IP, JL), pp. 430–445.
TOOLS-EUROPE-1999-Madsen #integration #object-oriented #state machine #towards: Towards Integration of State Machines and Object-Oriented Languages (OLM), pp. 261–274.
TOOLS-EUROPE-1999-Romanovsky #programming: Abstract Object State and Version Recovery in N-Version Programming (AR), pp. 86–95.
LOPSTR-1999-LeuschelM #abstract interpretation #infinity #model checking: Infinite State Model Checking by Abstract Interpretation and Program Specialisation (ML, TM), pp. 62–81.
ICSE-1999-DwyerAC #finite #specification #verification: Patterns in Property Specifications for Finite-State Verification (MBD, GSA, JCC), pp. 411–420.
CC-1999-ZhangGRG #performance #pipes and filters: Efficient State-Diagram Construction Methods for Software Pipelining (CZ, RG, SR, GRG), pp. 153–167.
CAV-1999-AbdullaABBHL #abstraction #analysis #infinity #reachability #verification: Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis (PAA, AA, SB, AB, PH, YL), pp. 146–159.
CAV-1999-BrunsG #logic #model checking: Model Checking Partial State Spaces with 3-Valued Temporal Logics (GB, PG), pp. 274–287.
CAV-1999-Lind-NielsenA #model checking: Stepwise CTL Model Checking of State/Event Systems (JLN, HRA), pp. 316–327.
CAV-1999-Spielmann #automation #state machine #verification: Automatic Verification of Abstract State Machines (MS), pp. 431–442.
CSL-1999-Franzle #analysis #hybrid #infinity: Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States (MF), pp. 126–140.
IWTCS-1999-YevtushenkoCA #embedded #finite #nondeterminism #state machine #testing: Test Suite Minimization for Embedded Nondeterministic Finite State Machines (NY, ARC, RA), pp. 237–250.
ASE-1998-CzernyH #analysis #automation #requirements: Automated Integrative Analysis of State-based Requirements (BJC, MPEH), p. 125–?.
DAC-1998-CongW #performance: Optimal FPGA Mapping and Retiming with Efficient Initial State Computation (JC, CW), pp. 330–335.
DAC-1998-HasteerMB #algorithm #automaton #verification: An Implicit Algorithm for Finding Steady States and its Application to FSM Verification (GH, AM, PB), pp. 611–614.
DAC-1998-MonteiroO #composition #finite #power management #state machine: Finite State Machine Decomposition For Low Power (JCM, ALO), pp. 758–763.
DAC-1998-SunVJ #performance #verification: Fast State Verification (DS, BV, WJ), pp. 619–624.
DAC-1998-XieB #classification #finite #markov #performance: Efficient State Classification of Finite State Markov Chains (AX, PAB), pp. 605–610.
DAC-1998-YangD #validation: Validation with Guided Search of the State Space (CHY, DLD), pp. 599–604.
DATE-1998-Eijk #equivalence #traversal: Sequential Equivalence Checking without State Space Traversal (CAJvE), pp. 618–623.
DATE-1998-HsiaoC #performance #sequence: State Relaxation Based Subsequence Removal for Fast Static Compaction in Sequential Circuits (MSH, STC), pp. 577–582.
DATE-1998-MarculescuMP #estimation #probability: Trace-Driven Steady-State Probability Estimation in FSMs with Application to Power Estimation (DM, RM, MP), pp. 774–779.
DATE-1998-MartinezAQH #problem: A Dynamic Model for the State Assignment Problem (MM, MJA, JMQ, JLH), pp. 835–839.
ESOP-1998-MaraninchiR #named: Mode-Automata: About Modes and States for Reactive Systems (FM, YR), pp. 185–199.
TACAS-1998-CharatonikP #analysis #infinity: Set-Based Analysis of Reactive Infinite-State Systems (WC, AP), pp. 358–375.
TACAS-1998-HuhnNW #verification: Verification Based on Local States (MH, PN, FW), pp. 36–51.
TACAS-1998-Lind-NielsenABHKL #analysis #composition #dependence #scalability #using #verification: Verification of Large State/Event Systems Using Compositionality and Dependency Analysis (JLN, HRA, GB, HH, KJK, KGL), pp. 201–216.
WRLA-1998-GiunchigliaBC #state of the art: The OMRS project: state of the art (FG, PB, AC), pp. 127–146.
STOC-1998-AharonovKN #quantum: Quantum Circuits with Mixed States (DA, AK, NN), pp. 20–30.
ICALP-1998-JancarKM #bisimulation #finite #process: Deciding Bisimulation-Like Equivalences with Finite-State Processes (PJ, AK, RM), pp. 200–211.
ICALP-1998-MukundKRS #finite #protocol #robust: Robust Asynchronous Protocols Are Finite-State (MM, KNK, JR, MAS), pp. 188–199.
WIA-1998-Pedrazzini #automaton #design pattern #finite: The Finite State Automata’s Design Patterns (SP), pp. 213–219.
FM-1998-Borger #analysis #design #state machine #using: High Level System Design and Analysis Using Abstract State Machines (EB), pp. 1–43.
FM-1998-Castillo #architecture #state machine #tool support #towards: Towards Comprehensive Tool Support for Abstract State Machines: The ASM Workbench Tool Environment and Architecture (GDC), pp. 311–325.
CHI-1998-RoweSI #human-computer #interactive #variability: Hear Rate Variability: Indicator of User State as an Aid to Human-Computer Interaction (DWR, JLS, DI), pp. 480–487.
ICPR-1998-ChenW #navigation #visual notation: State-based SHOSLIF for indoor visual navigation (SC, J(W), pp. 482–484.
ICPR-1998-KosmalaR98a #clustering #online #recognition #scalability #self #using: Tree-based state clustering using self-organizing principles for large vocabulary on-line handwriting recognition (AK, GR), pp. 1313–1315.
UML-1998-KhrissEK #automation #collaboration #diagrams #multi #statechart #synthesis #uml: Automating the Synthesis of UML StateChart Diagrams from Multiple Collaboration Diagrams (IK, ME, RKK), pp. 132–147.
OOPSLA-1998-Leino #specification: Data Groups: Specifying the Modification of Extended State (KRML), pp. 144–153.
TOOLS-USA-1998-MaY #diagrams #reduction: Practical Rules for Reduction on the Number of States of a State Diagram (JM, SY), p. 46–?.
POPL-1998-AriolaS #calculus #call-by #correctness #imperative #monad: Correctness of Monadic State: An Imperative Call-by-Need Calculus (ZMA, AS), pp. 62–74.
FSE-1998-AlurY #model checking #state machine: Model Checking of Hierarchical State Machines (RA, MY), pp. 175–188.
FSE-1998-JeffordsH #automation #generative #invariant #requirements #specification: Automatic Generation of State Invariants from Requirements Specifications (RDJ, CLH), pp. 56–69.
ASPLOS-1998-Weissman #approach #concurrent #locality #performance #thread: Performance Counters and State Sharing Annotations: a Unified Approach to Thread Locality (BW), pp. 127–138.
HPCA-1998-VengroffG #branch #estimation #performance #predict #re-engineering: Partial Sampling with Reverse State Reconstruction: A New Technique for Branch Predictor Performance Estimation (DEV, GRG), pp. 342–351.
CADE-1998-Malik #automation #deduction #finite #source code: Automated Deduction of Finite-State Control Programs for Reactive Systems (RM), pp. 302–316.
CAV-1998-BensalemLO #abstraction #automation #infinity: Computing Abstractions of Infinite State Systems Compositionally and Automatically (SB, YL, SO), pp. 319–331.
CAV-1998-ColonU #abstraction #finite #generative #using: Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures (MC, TEU), pp. 293–304.
CAV-1998-IslesHB #infinity #memory management: Computing Reachable Control States of Systems Modeled with Uninterpreted Functions and Infinite Memory (AJI, RH, RKB), pp. 256–267.
CAV-1998-Mitchell #analysis #finite #protocol #security: Finite-State Analysis of Security Protocols (JCM), pp. 71–76.
CAV-1998-WolperB #infinity #verification: Verifying Systems with Infinite but Regular State Spaces (PW, BB), pp. 88–97.
CSL-1998-YannakakisL #finite #testing: Testing for Finite State Systems (MY, DL), pp. 29–44.
ISSTA-1998-ChanABN #model checking #performance #requirements: Improving Efficiency of Symbolic Model Checking for State-Based System Requirements (WC, RJA, PB, DN), pp. 102–112.
IWTCS-1998-Boroday #finite #nondeterminism #state machine #testing: Distinguishing Tests for Nondeterministic Finite State Machines (SB), pp. 101–108.
IWTCS-1998-Ek #generative #state of the art #testing: Testing and Test Generation: State of the Art and Future Expectations (AE), pp. 293–306.
IWTCS-1998-WalterSG #architecture #distributed #state of the art: Test Architectures for Distributed Systems: State of the Art and Beyond (TW, IS, JG), pp. 149–174.
LICS-1998-EmersonN #infinity #model checking #nondeterminism #on the: On Model Checking for Non-Deterministic Infinite-State Systems (EAE, KSN), pp. 70–80.
ASE-1997-GirardKS #approach #data type #detection: A Metric-based Approach to Detect Abstract Data Types and State Encapsulations (JFG, RK, GS), pp. 82–89.
DAC-1997-MarculescuMP #analysis #finite #probability #sequence #state machine: Sequence Compaction for Probabilistic Analysis of Finite-State Machines (DM, RM, MP), pp. 12–15.
EDTC-1997-HsiaoRP #generative #testing #traversal #using: Sequential circuit test generation using dynamic state traversal (MSH, EMR, JHP), pp. 22–28.
EDTC-1997-PomeranzR97a #finite #on the #state machine #testing: On the use of reset to increase the testability of interconnected finite-state machines (IP, SMR), pp. 554–559.
ICDAR-1997-SrihariK #integration: Integration of hand-written address interpretation technology into the United States Postal Service Remote Computer Reader system (SNS, EJK), pp. 892–896.
TACAS-1997-KrimmM #composition #generative #source code: Compositional State Space Generation from Lotos Programs (JPK, LM), pp. 239–258.
TACAS-1997-ParashkevovY #analysis #performance #pseudo #reachability: Space Efficient Reachability Analysis Through Use of Pseudo-Root States (ANP, JY), pp. 50–64.
WCRE-1997-GirardKS #architecture #comparison #comprehension #data type #detection #encapsulation: Comparison of Abstract Data Type and Abstract State Encapsulation Detection Techniques for Architectural Understanding (JFG, RK, GS), pp. 66–75.
WPC-1997-KloschWTs #component #comprehension #state machine: Facilitating Program Comprehension via Generic Components for State Machines (RK, JW, GT, HCG), pp. 118–127.
DLT-1997-IwamaT #automaton #bound #nondeterminism: Tight Bounds on the Number of States of DFA’s That Are Equivalent to n-state NFA’s (KI, KT), pp. 147–154.
WIA-1997-GarzonGRMDFS #finite #implementation #state machine: In Vitro Implementation of Finite-State Machines (MHG, YG, JAR, RCM, RJD, DRF, SESJ), pp. 56–74.
WIA-1997-MohriPR #design #finite #library #transducer: A Rational Design for a Weighted Finite-State Transducer Library (MM, FCNP, MR), pp. 144–158.
ICFP-1997-Kagawa #composition #functional #programming: Compositional References for Stateful Functional Programming (KK), pp. 217–226.
ICFP-1997-LaunchburyS #axiom #monad #type safety: Monadic State: Axiomatization and Type Safety (JL, AS), pp. 227–238.
HCI-SEC-1997-KrishnanM: Strategies for Integrating and Separating Pen-Based Operational States (SNK, SM), pp. 439–442.
HCI-SEC-1997-MulgundRIZ #estimation #interface #modelling: Situation Awareness Modeling and Pilot State Estimation for Tactical Cockpit Interfaces (SSM, GR, CI, GZ), pp. 487–490.
UML-1997-Frank #modelling #object-oriented #open science #research #state of the art: Object-Oriented Modeling Languages: State of the Art and Open Research Questions (UF), pp. 14–31.
ECOOP-1997-Almeida #data type: Balloon Types: Controlling Sharing of State in Data Types (PSA), pp. 32–59.
RE-1997-HeimdahlK #generative #requirements: Generating Code from Hierarchical State-Based Requirements (MPEH, DJK), p. 210–?.
ESEC-FSE-1997-HeimdahlW #reduction #slicing #state machine: Reduction and Slicing of Hierarchical State Machines (MPEH, MWW), pp. 450–467.
ICSE-1997-Perry #architecture #bibliography #state of the art: An Overview of the State of the Art in Software Architecture (DEP), pp. 590–591.
ICSE-1997-PezzeY #analysis #modelling #multi #semantics #tool support #using: Constructing Multi-Formalism State-Space Analysis Tools: Using Rules to Specify Dynamic Semantics of Models (MP, MY), pp. 239–249.
ASF+SDF-1997-BrandHK #asf+sdf #ide #legacy: Renovation of the ASF+SDF meta-environment: current state of affairs (MvdB, JH, PK), p. 4.
CADE-1997-EastaughffeOC #formal method #proving #state machine #visual notation: Proof Tactics for a Theory of State Machines in a Graphical Environment (KAE, MAO, AC), pp. 366–379.
CAV-1997-AlurBHQR #partial order #reduction: Partial-Order Reduction in Symbolic State Space Exploration (RA, RKB, TAH, SQ, SKR), pp. 340–351.
CAV-1997-BultanGP #infinity #model checking #using: Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic (TB, RG, WP), pp. 400–411.
CAV-1997-GrafS #graph: Construction of Abstract State Graphs with PVS (SG, HS), pp. 72–83.
DAC-1996-CortadellaKKLY #encoding #synthesis #tool support: Methodology and Tools for State Encoding in Asynchronous Circuit Synthesis (JC, MK, AK, LL, AY), pp. 63–66.
DAC-1996-HiguchiM #algorithm #finite #performance #reduction #state machine: A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines (HH, YM), pp. 463–466.
DAC-1996-IpD #reduction #using: State Reduction Using Reversible Rules (CNI, DLD), pp. 564–567.
DAC-1996-XiangVFP #design: Partial Scan Design Based on Circuit State Information (DX, SV, WKF, JHP), pp. 807–812.
SIGMOD-1996-Mohan #research #state of the art #workflow: State of the Art in Workflow Management Research and Products (CM), p. 544.
VLDB-1996-ShethKMWDLPLS #multi #using #workflow: Supporting State-Wide Immunisation Tracking Using Multi-Paradigm Workflow Technology (APS, KK, JAM, DW, SD, CL, DP, JL, IS), pp. 263–273.
ICALP-1996-ShuklaHRS #complexity #finite #on the #problem #process #relational: On the Complexity of Relational Problems for Finite State Processes (Extended Abstract) (SKS, HBHI, DJR, RES), pp. 466–477.
WIA-1996-BoneDGM #automaton #finite: Time Series Forecasting by Finite-State Automata (RB, CD, AG, DM), pp. 26–34.
WIA-1996-Noord #automaton #finite: FSA Utilities: A Toolbox to Manipulate Finite-State Automata (GvN), pp. 87–108.
CSCW-1996-PoltrockG #case study #experience #roadmap #tutorial #workflow: CSCW, Groupware and Workflow: Experiences, State of Art and Future Trends (Tutorial) (SEP, JG), p. 3.
TRI-Ada-1996-Sanden #state machine: The State-Machine Pattern (BS), pp. 135–142.
CAV-1996-BoigelotG #communication #infinity #protocol #using #verification: Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract) (BB, PG), pp. 1–12.
CAV-1996-HolzmannP: The State of SPIN (GJH, DP), pp. 385–389.
ISSTA-1996-KangL #analysis #generative #performance #realtime: An Efficient State Space Generation for Analysis of Real-Time Systems (IK, IL), pp. 4–13.
ISSTA-1996-PezzeY #analysis #generative #multi #tool support: Generation of Multi-Formalism State-Space Analysis Tools (MP, MY), pp. 172–179.
LICS-1996-AbdullaCJT #decidability #infinity #theorem: General Decidability Theorems for Infinite-State Systems (PAA, KC, BJ, YKT), pp. 313–321.
DAC-1995-LiuPD #performance #scalability: A Fast State Assignment Procedure for Large FSMs (SL, MP, AMD), pp. 327–332.
DAC-1995-TelicheveskyKW #analysis #performance: Efficient Steady-State Analysis Based on Matrix-Free Krylov-Subspace Methods (RT, KSK, JW), pp. 480–484.
TACAS-1995-FrancescoFGI #approximate #finite #model checking #process: Model Checking of Non-Finite State Processes by Finite Approximations (NDF, AF, SG, PI), pp. 195–215.
TACAS-1995-KnoopSV #analysis #exclamation #explosion #for free #parallel: Parallelism for Free: Bitvector Analyses -> No State Explosion! (JK, BS, JV), pp. 264–289.
DLT-1995-Banik #turing machine: Colonies as Systems of Turing Machines Without States (IB), pp. 189–198.
DLT-1995-Giammarresi #2d #bibliography #finite: Finite State Recognizability for Two-Dimensional Languages: A Brief Survey (DG), pp. 299–308.
ICALP-1995-CulikK #finite #image: Finite State Transformations of Images (KCI, JK), pp. 51–62.
ICML-1995-McCallum #learning: Instance-Based Utile Distinctions for Reinforcement Learning with Hidden State (AM), pp. 387–395.
OOPSLA-1995-SaneC #composition #object-oriented #state machine #subclass: Object-Oriented State Machines: Subclassing, Composition, Delegation and Genericity (AS, RHC), pp. 17–32.
POPL-1995-BouajjaniEH #composition #infinity #parallel #process #verification: Verifying Infinite State Processes with Sequential and Parallel Composition (AB, RE, PH), pp. 95–106.
SAC-1995-Berghel #named #navigation #state of the art: CYBER-SURFING: the state-of-the-art in client server browsing and navigation (HB), pp. 1–4.
SAC-1995-McBrideGF #simulation: Simulation of a state prison population (RAM, DRG, SF), pp. 427–430.
FSE-1995-CheungK #analysis #composition #constraints #distributed #finite #reachability: Compositional Reachability Analysis of Finite-State Distributed Systems with User-Specified Constraints (SCC, JK), pp. 140–150.
FSE-1995-HoffmanS #abstraction #composition #development: State Abstraction and Modular Software Development (DH, PAS), pp. 53–61.
ICSE-1995-HeimdahlL #analysis #consistency #requirements: Completeness and Consistency Analysis of State-Based Requirements (MPEH, NGL), pp. 3–14.
ICSE-1995-VottaP #re-engineering #state of the art: Experimental Software Engineering: A Report on the State of the Art (LGV, AAP), pp. 277–279.
HPCA-1995-NuthD #implementation #performance: The Named-State Register File: Implementation and Performance (PRN, WJD), pp. 4–13.
LCT-RTS-1995-CamposCMM #analysis #finite #named #realtime: Verus: A Tool for Quantitative Analysis of Finite-State Real-Time Systems (SVAC, EMC, WRM, MM), pp. 70–78.
CAV-1995-AzizBBDS #finite #state machine: Supervisory Control of Finite State Machines (AA, FB, RKB, MDD, AS), pp. 279–292.
CAV-1995-DingelF #abstraction #infinity #model checking #proving #reasoning #theorem proving #using: Model Checking for Infinite State Systems Using Data Abstraction, Assumption-Commitment Style reasoning and Theorem Proving (JD, TF), pp. 54–69.
CAV-1995-JonssonK #algorithm #distributed #infinity #safety #verification: Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms (BJ, LK), pp. 42–53.
CAV-1995-Lescow #finite #game studies #on the #source code: On Polynomial-Size Programs Winning Finite-State Games (HL), pp. 239–252.
ILPS-1995-TarauDF #backtracking #continuation #linear: Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars (PT, VD, AF), p. 642.
DAC-1994-AzizTB #finite #state machine: BDD Variable Ordering for Interacting Finite State Machines (AA, ST, RKB), pp. 283–288.
DAC-1994-DagaB #composition #interface #state machine: The Minimization and Decomposition of Interface State Machines (AJD, WPB), pp. 120–125.
DAC-1994-DahlgrenL #modelling #network: Modeling of Intermediate Node States in switch-Level Networks (PD, PL), pp. 722–727.
DAC-1994-HachtelMPS #analysis #finite #probability #scalability #state machine: Probabilistic Analysis of Large Finite State Machines (GDH, EM, AP, FS), pp. 270–275.
DAC-1994-KamVBS #algorithm: A Fully Implicit Algorithm for Exact State Minimization (TK, TV, RKB, ALSV), pp. 684–690.
DAC-1994-KrishnakumarC #hybrid #modelling #on the #set: On the Computation of the Set of Reachable States of Hybrid Models (ASK, KTC), pp. 615–621.
DAC-1994-LamBS #finite #state machine: Exact Minimum Cycle Times for Finite State Machines (WKCL, RKB, ALSV), pp. 100–105.
EDAC-1994-ChoHMPS #algorithm #approximate #automaton #composition #traversal: A State Space Decomposition Algorithm for Approximate FSM Traversal (HC, GDH, EM, MP, FS), pp. 137–141.
EDAC-1994-Damiani #finite #nondeterminism #state machine: Nondeterministic finite-state machines and sequential don’t cares (MD), pp. 192–198.
EDAC-1994-HachtelMPS #algorithm #finite #state machine: Symbolic Algorithms to Calculate Steady-State Probabilities of a Finite State Machine (GDH, EM, AP, FS), pp. 214–218.
EDAC-1994-WatanabeB #automaton #nondeterminism #pseudo: State Minimization of Pseudo Non-Deterministic FSM’s (YW, RKB), pp. 184–191.
VLDB-1994-ZemankovaI #database #state of the art: Scientific Databases — State of the Art and Future Directions (MZ, YEI), pp. 752–753.
ICSM-1994-BoldyreffBH #evaluation #state of the art: An Evaluation of the State-of-the-Art for Application Management (CB, EB, RMH), pp. 161–169.
PLDI-1994-LaunchburyJ #functional #lazy evaluation #thread: Lazy Functional State Threads (JL, SLPJ), pp. 24–35.
STOC-1994-CondonHPW #automaton #finite #nondeterminism #on the #power of #probability: On the power of finite automata with both nondeterministic and probabilistic states (preliminary version) (AC, LH, SP, AW), pp. 676–685.
TRI-Ada-1994-RybinK #ada #programming language: Ada-Based Programming Language Course in Moscow State University (SR, VSK), pp. 194–202.
ICML-1994-SinghJJ #learning #markov #process: Learning Without State-Estimation in Partially Observable Markovian Decision Processes (SPS, TSJ, MIJ), pp. 284–292.
KDD-1994-AnandBH #architecture #database #mining #optimisation #preprocessor #query #semantics: Database Mining in the Architecture of a Semantic Preprocessor for State Aware Query Optimization (SSA, DAB, JGH), pp. 287–298.
KR-1994-BarndenHIS #implementation #nondeterminism #reasoning: An Integrated Implementation of Simulative, Uncertain and Metaphorical Reasoning about Mental States (JAB, SH, EI, GCS), pp. 27–38.
OOPSLA-1994-EifrigSTZ #decidability #object-oriented #type system: Application of OOP Type Theory: State, Decidability, Integragtion (JE, SFS, VT, AEZ), pp. 16–30.
ICSE-1994-TakadaMT #debugging #performance #process #testing: A Programmer Performance Measure Based on Programmer State Transitions in Testing and Debugging Process (YT, KiM, KT), pp. 123–132.
HPDC-1994-Benslimane #bound #communication #finite #state machine: Deciding Boundedness for Systems of Two Communicating Finite State Machines (AB), pp. 262–269.
CAV-1994-CousinH #performance: Performance Improvement of State Space Exploration by Regular & Diffrential Hashing Functions (BC, JMH), pp. 364–376.
CAV-1994-DamsGDHKP #abstraction #adaptation #model checking #using: Model Checking Using Adaptive State and Data Abstraction (DD, RG, GD, RH, PK, HP), pp. 455–467.
ICLP-1994-LaunchburyJ #lazy evaluation #thread: Lazy Funtional State Threads: An Abstract (JL, SLPJ), pp. 3–5.
ISSTA-1994-Young #analysis #testing: State-Space Analysis as an Aid to Testing (Abstract) (MY), p. 203.
LICS-1994-Clarke #automation #concurrent #finite #verification: Automatic Verification of Finite-State Concurrent Systems (EMC), p. 126.
DAC-1993-Birger #simulation: The State of Simulation in Russia (AB), pp. 712–715.
DAC-1993-ChengK #automation #finite #functional #generative #state machine #testing #using: Automatic Functional Test Generation Using the Extended Finite State Machine Model (KTC, ASK), pp. 86–91.
DAC-1993-ChuML #finite #performance #state machine: An Efficient Critical Race-Free State Assignment Technique for Asynchronous Finite State Machines (TAC, NM, CKCL), pp. 2–6.
DAC-1993-Leveugle #fault tolerance: Optimized State Assignment of single fault Tolerant FSMs Based on SEC Codes (RL), pp. 14–18.
DAC-1993-MatsunagaMB #on the #transitive: On Computing the Transitive Closure of a State Transition Relation (YM, PCM, RKB), pp. 260–265.
DAC-1993-Mikhov: The State of EDA in Russian Universities (VMM), pp. 716–719.
DAC-1993-MotoharaHMMKSS #algorithm #matrix #traversal #using: A State Traversal Algorithm Using a State Covariance Matrix (AM, TH, MM, HM, KK, YS, SS), pp. 97–101.
DAC-1993-RhoSP #finite #sequence #state machine: Minimum Length Synchronizing Sequences of Finite State Machine (JKR, FS, CP), pp. 463–468.
DAC-1993-Tatarnikov: The State of VHDL in Russia (YT), pp. 709–711.
DAC-1993-Yarnikh: The State of CAD and VLSI in Russia (VY), pp. 707–708.
ICDAR-1993-MatsuiNYWY #contest #recognition #state of the art: State of the art of handwritten numeral recognition in Japan-The results of the first IPTP character recognition competition (TM, TN, IY, TW, MY), pp. 391–396.
ICDAR-1993-TsuruokaKMSC #recognition #segmentation: Segmentation and recognition for handwritten 2-letter state names (ST, FK, YM, MS, ZC), pp. 814–817.
CSM-1993-TurnerR #object-oriented #source code #testing: The State-Based Testing of Object-Oriented Programs (CDT, DJR), pp. 302–310.
ICALP-1993-CohenF #finite #state machine: Products of Finite State Machines with Full Coverage (DMC, MLF), pp. 469–477.
SEKE-1993-DingK #behaviour #specification #state machine: Attributed State Machines For Behavior Specification of Reactive Systems (SD, TK), pp. 695–702.
TOOLS-USA-1993-LecoeucheS: Introducing States in the Object Model (HL, JLS), pp. 69–81.
PLILP-1993-NataliO #logic programming: Objects with State in Contextual Logic Programming (AN, AO), pp. 220–234.
RE-1993-LubarsPR #bibliography #modelling #requirements: A review of the state of the practice in requirements modeling (MDL, CP, CR), pp. 2–14.
ICSE-1993-Brown: An Examination of the Current State of IPSE Technology (AWB), pp. 338–347.
CAV-1993-Krishnakumar #composition #finite #reachability #state machine: Reachability and Recurrence in Extended Finite State Machines: Modular Vector Addition Systems (ASK), pp. 110–122.
ISSTA-1993-AvritzerL #testing #using: Load Testing Software Using Deterministic State Testing (AA, BL), pp. 82–88.
ISSTA-1993-DuriBDS #ada #analysis #concurrent #reduction #using: Using State Space Reduction Methods for Deadlock Analysis in Ada Tasking (SD, UAB, RD, SMS), pp. 51–60.
ISSTA-1993-FelderGP #specification: Analyzing Refinements of State Based Specifications: The Case of TB Nets (MF, CG, MP), pp. 28–39.
IWPTS-1993-LuoDBVG #distributed #finite #generative #sequence #state machine #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 #state machine #testing: Nondeterministic State Machines in Protocol Conformance Testing (AP, NY, AL, AD), pp. 363–378.
DAC-1992-ChakradharKA #fault tolerance #finite #state machine #synthesis: Finite State Machine Synthesis with Fault Tolerant Test Function (STC, SK, VDA), pp. 562–567.
DAC-1992-HefferanS #maintenance #state of the art: Acquiring and Maintaining State-of-the-Art DA Systems (PMH, SS), pp. 387–392.
DAC-1992-LavagnoMBS #graph #problem: Solving the State Assignment Problem for Signal Transition Graphs (LL, CWM, RKB, ALSV), pp. 568–572.
DAC-1992-PomeranzC #using: State Assignment Using Input/Output Functions (IP, KTC), pp. 573–577.
KR-1992-Poesio: Conversational Events and Discourse State Change: A Preliminary Report (MP), pp. 369–380.
CAV-1992-GodefroidHP #revisited: State-Space Caching Revisited (PG, GJH, DP), pp. 178–191.
CAV-1992-HiguchiSSFK #communication #finite #invariant #state machine #verification: A Verification Procedure via Invariant for Extended Communicating Finite-State Machines (MH, OS, HS, MF, TK), pp. 384–395.
CAV-1992-McMillan #explosion #problem #using #verification: Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits (KLM), pp. 164–177.
IWPTS-1992-GhedamsiDB #fault #finite #nondeterminism #state machine #testing: Diagnostic Tests for Single Transition Faults in Non-Deterministic Finite State Machines (AG, RD, GvB), pp. 105–116.
IWPTS-1992-Kloosterman #finite #nondeterminism #state machine: Test Derivation from Non-Deterministic Finite State Machines (HK), pp. 297–308.
IWPTS-1992-TripathyN #adaptation #finite #generative #modelling #nondeterminism #testing: Generation of Adaptive Test Cases from Nondeterministic Finite State Models (PT, KN), pp. 309–320.
DAC-1991-CiesielskiSD #approach #automaton #encoding: A Unified Approach to Input-Output Encoding for FSM State Assignment (MJC, JJS, MD), pp. 176–181.
DAC-1991-EschermannW #approach #finite #self #state machine #synthesis: A Unified Approach for the Synthesis of Self-Testable Finite State Machines (BE, HJW), pp. 372–377.
DAC-1991-LaddB #finite #multi #state machine #synthesis: Synthesis of Multiple-Input Change Asynchronous Finite state Machines (ML, WPB), pp. 309–314.
STOC-1991-YannakakisL #finite #state machine #testing: Testing Finite State Machines (Extended Abstract) (MY, DL), pp. 476–485.
ICALP-1991-Hashiguchi #algorithm #generative #regular expression: Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language (KH), pp. 641–648.
VDME-1991-1-Stolen #concurrent: An Attempt to Reason about Shared-State Concurrency in the Style of VDM (KS), pp. 324–342.
FPCA-1991-BarthNA #functional #named #parallel #strict: M-Structures: Extending a Parallel, Non-strict, Functional Language with State (PSB, RSN, A), pp. 538–568.
ML-1991-MaclinS #automaton #finite: Refining Domain Theories Expressed as Finite-State Automata (RM, JWS), pp. 524–528.
CAV-1991-FinkelP #composition #graph: Avoiding State Exposion by Composition of Minimal Covering Graphs (AF, LP), pp. 169–180.
CAV-1991-LangevinC #state machine: Comparing Generic State Machines (ML, EC), pp. 466–476.
CAV-1991-MaoM #automation #equivalence #finite #proving #state machine: An Automated Proof Technique for Finite-State Machine Equivalence (WM, GJM), pp. 233–243.
CAV-1991-Sterling #infinity: Taming Infinite State Spaces (CS), p. 1.
IWPTS-1991-DubucDB #design #finite #incremental #modelling #named #testing: TESTL: An Environment for Incremental Test Suite Design Based on Finite-State Models (MD, RD, GvB), pp. 195–206.
IWPTS-1991-FujiwaraB #fault #nondeterminism #state machine #testing: Testing Non-Deterministic State Machines with Fault Coverage (SF, GvB), pp. 267–280.
SEI-1990-AdamsK #state of the art: A State-of-the-Art CS Undergraduate Lab (JMA, BLK), pp. 85–94.
VDME-1990-WoodcockM #concurrent #refinement: Refinement of State-Based Concurrent Systems (JW, CM), pp. 340–351.
CHI-1990-Williges #bibliography #human-computer #interface: Human-computer interface laboratory — Virginia Polytechnic Institute and State University (lab review) (RCW), pp. 283–284.
SEKE-1990-Clark #predict: A State Space Model for Currency Exchange Rate Prediction (JC), pp. 267–271.
CAV-1990-Clarke #explosion #logic #model checking #problem: Temporal Logic Model Checking: Two Techniques for Avoiding the State Explosion Problem (EMC), p. 1.
CAV-1990-CoudertMB #diagrams #verification: Verifying Temporal Properties of Sequential Machines Without Building their State Diagrams (OC, JCM, CB), pp. 23–32.
CAV-1990-GrafS #composition #finite: Compositional Minimization of Finite State Systems (SG, BS), pp. 186–196.
CAV-1990-PengP #approach #communication #concurrent #detection #finite #network #problem #state machine: A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines (WP, SP), pp. 243–252.
CAV-1990-ProbstL #explosion #partial order #problem #semantics #using: Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems (DKP, HFL), pp. 146–155.
CAV-1990-Valmari #explosion: A Stubborn Attack On State Explosion (AV), pp. 156–165.
LICS-1990-BurchCMDH #model checking: Symbolic Model Checking: 10^20 States and Beyond (JRB, EMC, KLM, DLD, LJH), pp. 428–439.
LICS-1990-GoldmanL #modelling: Modelling Shared State in a Shared Action Model (KJG, NAL), pp. 450–463.
DAC-1989-DervisogluK #debugging #named #state of the art #tool support: ATLAS/ELA: Scan-based Software Tools for Reducing System Debug Time in a State-of-the-art Workstation (BID, MAK), pp. 718–721.
DAC-1989-Devadas89a #composition: General Decomposition of Sequential Machines: Relationships to State Assignment (SD), pp. 314–320.
DAC-1989-Paulin #clustering #finite #state machine: Horizontal Partitioning of PLA-based Finite State Machines (PGP), pp. 333–338.
DAC-1989-SaucierDP #using: State Assignment Using a New Embedding Method Based on an Intersecting Cube Theory (GS, CD, FP), pp. 321–326.
DAC-1989-VillaS #finite #implementation #logic #named #state machine: NOVA: State Assignment of Finite State Machines for Optimal Two-level Logic Implementations (TV, ALSV), pp. 327–332.
CAiSE-1989-McDaniel #information management #using: Using PSL/PSA to Model Information System Planning for The United States Department of the Army Headquarters (PDM).
ML-1989-Riddle #reduction: Reformation from State Space to Reduction Space (PJR), pp. 439–440.
SEKE-1989-Tang #automation #concurrent #infinity #source code #verification: Temporal Theory for Automatic Verification of Infinite State Concurrent Programs (TGT), pp. 134–139.
SIGIR-1989-Parkes #automation #image #network: Settings and the Setting Structure: The Description and Automated Propagation of Networks for Perusing Videodisk Image States (APP), pp. 229–238.
ESEC-1989-Thomas #state of the art: Asking for the Impossible: The State of the Art in Safety-Related Systems (MT), pp. 42–47.
ICSE-1989-DeMarcoL #development #state of the art: Software Development: State of the Art vs. State of the Practice (TD, TL), pp. 271–275.
ICSE-1989-HumphreyKK #re-engineering: The State of Software Engineering Practice: A Preliminary Report (WSH, DHK, TCK), pp. 277–288.
ASPLOS-1989-Staknis #architecture #memory management: Sheaved Memory: Architectural Support for State Saving and Restoration in Paged Systems (MES), pp. 96–102.
DAC-1988-WolfKA #algorithm #kernel #logic #multi: A Kernel-Finding State Assignment Algorithm for Multi-Level Logic (WW, KK, JA), pp. 433–438.
CSL-1988-DaneluttoM #approach #concurrent #finite #logic: A temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems (MD, AM), pp. 63–79.
DAC-1987-Kingsley #compilation #implementation #state machine: The Implementation of a State Machine Compiler (CK), pp. 580–583.
DAC-1987-OwensI #bibliography #design: An Overview of the Penn State Design System (RMO, MJI), pp. 516–522.
HCI-CE-1987-BullingerFZ #named #roadmap: Software-Ergonomics: History, State-of-Art and Important Trends (HJB, KPF, JZ), pp. 307–316.
DAC-1986-Coppola #heuristic #implementation: An implementation of a state assignment heuristic (AJC), pp. 643–649.
ESOP-1986-Stark #concept #proving #specification: Proving Entailment Between Conceptual State Specifications (EWS), pp. 197–209.
ICALP-1986-RosierY #complexity #concurrent #finite #on the #probability #source code #termination: On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs (LER, HCY), pp. 334–343.
SIGIR-1986-BelkinK #documentation #retrieval #using: Using Structural Representations of Anomalous States of Knowledge for Choosing Document Retrieval Strategies (NJB, BHK), pp. 11–22.
LICS-1986-BensonB #automaton #bisimulation: Strong Bisimulation of State Automata (DBB, OBS), pp. 77–81.
LICS-1986-Browne #algorithm #automation #finite #logic #using #verification: An Improved Algorithm for the Automatic Verification of Finite State Systems Using Temporal Logic (MCB), pp. 260–266.
POPL-1985-LichtensteinP #concurrent #finite #linear #source code #specification: Checking That Finite State Concurrent Programs Satisfy Their Linear Specification (OL, AP), pp. 97–107.
PODS-1984-GrahamV #axiom #complexity #consistency #database #on the: On the Complexity and Axiomatizability of Consistent Database States (MHG, MYV), pp. 281–289.
ICALP-1984-GoudaR #communication #finite #state machine: Communicating Finite State Machines with Priority Channels (MGG, LER), pp. 209–221.
DAC-1983-OgiharaMTKF #bidirectional #design #generative #testing: Test generation for scan design circuits with tri-state modules and bidirectional terminals (TO, SM, YT, KK, HF), pp. 71–78.
POPL-1983-ClarkeES #approach #automation #concurrent #finite #logic #specification #using #verification: Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach (EMC, EAE, APS), pp. 117–126.
DAC-1982-Breuer #automation #bibliography #design #state of the art: A survey of the state-of-the-art of design automation an invited presentation (MAB), p. 1.
SIGMOD-1982-ImielinskiL82a #database: A Technique for Translating States Between Database Schemata (TI, WLJ), pp. 61–68.
ICALP-1982-DurisH #automaton #finite #multi: Multihead Finite State Automata and Concatenation (PD, JH), pp. 176–186.
ICSE-1982-Ling #design #diagrams #source code #using: Designing Data Entry Programs Using State Diagram as a Common Model (MML), pp. 296–308.
DAC-1981-Brown #state machine: A State-Machine Synthesizer — SMS (DWB), pp. 301–305.
DAC-1981-Sherwood #logic #modelling #simulation: A MOS modelling technique for 4-state true-value hierarchical logic simulation or Karnough knowledge (WS), pp. 775–785.
SDCG-1980-Schmidt #λ-calculus: State transition machines for λ calculus expressions (DAS), pp. 415–440.
ICALP-1978-PriceW #stack: States Can Sometimes Do More Than Stack Symbols in PDA’s (JKP, DW), pp. 353–362.
ICSE-1978-ChungG #diagrams: Use of State Diagrams to Engineer Communications Software (PC, BG), pp. 215–221.
ICALP-1977-ChytilJ #composition #finite #source code #string #transducer: Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings (MC, VJ), pp. 135–147.
DAC-1975-CiompiSTV #automation #design #roadmap #state of the art: State of the art and trends in Design Automation in Italy (PC, LS, MT, GV), pp. 23–31.
ICALP-1972-Kemp #estimation #lr #set: An Estimation of the Set of States of the Minimal LR(0)-Acceptor (RK), pp. 563–574.
STOC-1971-Rajlich #finite #parallel #transducer: Absolutely Parallel Grammars and Two-Way Deterministic Finite-State Transducers (VR), pp. 132–137.