{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BO2GBVHE5DBISDFNT6TAQNADJR","short_pith_number":"pith:BO2GBVHE","schema_version":"1.0","canonical_sha256":"0bb460d4e4e8c2890cad9fa60834034c5e84796475ec86ebc51178aaba529ca0","source":{"kind":"arxiv","id":"1209.5325","version":3},"attestation_state":"computed","paper":{"title":"Runtime Verification Based on Register Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.FL","authors_text":"Dino Distefano, Nikos Tzevelekos, Radu Grigore, Rasmus Lerchedahl Petersen","submitted_at":"2012-09-24T16:33:13Z","abstract_excerpt":"We propose TOPL automata as a new method for runtime verification of systems with unbounded resource generation. Paradigmatic such systems are object-oriented programs which can dynamically generate an unbounded number of fresh object identities during their execution. Our formalism is based on register automata, a particularly successful approach in automata over infinite alphabets which administers a finite-state machine with boundedly many input-storing registers. We show that TOPL automata are equally expressive to register automata and yet suitable to express properties of programs. Compa"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1209.5325","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-09-24T16:33:13Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"f75d8ba28d3148b601445e559f443bfcc3b5a9a28cb0fa27880a9bbc7c94cac8","abstract_canon_sha256":"557719bd432182d1a7e2d6d0d3d3fdfd39f9e36d5352e929e8d0aed592d793c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:08.560063Z","signature_b64":"WKVkdn5jVL4NwJqOrokZjibCp6AJcdRONtIuvKNkF6r59INVIH3A+uQFmokwP0gd+XEHoN6o6OMeL9wu5u8dAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bb460d4e4e8c2890cad9fa60834034c5e84796475ec86ebc51178aaba529ca0","last_reissued_at":"2026-05-18T02:29:08.559456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:08.559456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Runtime Verification Based on Register Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.FL","authors_text":"Dino Distefano, Nikos Tzevelekos, Radu Grigore, Rasmus Lerchedahl Petersen","submitted_at":"2012-09-24T16:33:13Z","abstract_excerpt":"We propose TOPL automata as a new method for runtime verification of systems with unbounded resource generation. Paradigmatic such systems are object-oriented programs which can dynamically generate an unbounded number of fresh object identities during their execution. Our formalism is based on register automata, a particularly successful approach in automata over infinite alphabets which administers a finite-state machine with boundedly many input-storing registers. We show that TOPL automata are equally expressive to register automata and yet suitable to express properties of programs. Compa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5325","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.5325","created_at":"2026-05-18T02:29:08.559549+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5325v3","created_at":"2026-05-18T02:29:08.559549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5325","created_at":"2026-05-18T02:29:08.559549+00:00"},{"alias_kind":"pith_short_12","alias_value":"BO2GBVHE5DBI","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BO2GBVHE5DBISDFN","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BO2GBVHE","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BO2GBVHE5DBISDFNT6TAQNADJR","json":"https://pith.science/pith/BO2GBVHE5DBISDFNT6TAQNADJR.json","graph_json":"https://pith.science/api/pith-number/BO2GBVHE5DBISDFNT6TAQNADJR/graph.json","events_json":"https://pith.science/api/pith-number/BO2GBVHE5DBISDFNT6TAQNADJR/events.json","paper":"https://pith.science/paper/BO2GBVHE"},"agent_actions":{"view_html":"https://pith.science/pith/BO2GBVHE5DBISDFNT6TAQNADJR","download_json":"https://pith.science/pith/BO2GBVHE5DBISDFNT6TAQNADJR.json","view_paper":"https://pith.science/paper/BO2GBVHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5325&json=true","fetch_graph":"https://pith.science/api/pith-number/BO2GBVHE5DBISDFNT6TAQNADJR/graph.json","fetch_events":"https://pith.science/api/pith-number/BO2GBVHE5DBISDFNT6TAQNADJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BO2GBVHE5DBISDFNT6TAQNADJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BO2GBVHE5DBISDFNT6TAQNADJR/action/storage_attestation","attest_author":"https://pith.science/pith/BO2GBVHE5DBISDFNT6TAQNADJR/action/author_attestation","sign_citation":"https://pith.science/pith/BO2GBVHE5DBISDFNT6TAQNADJR/action/citation_signature","submit_replication":"https://pith.science/pith/BO2GBVHE5DBISDFNT6TAQNADJR/action/replication_record"}},"created_at":"2026-05-18T02:29:08.559549+00:00","updated_at":"2026-05-18T02:29:08.559549+00:00"}