[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"a4e596b022b8c1129d1660c00bb5dc9cf09ff6e6ed786d0c35053bb97db3a9bc","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-03b0bbb9723907cf3d1b41cf0bb34837dc398e42","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"118997c984cdc731fd71e5d287fee98eb91255eb9c56ef1642821ee3d914dd22","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0837245627eb714ae6bb0375f7abe8f41042011f","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"118997c984cdc731fd71e5d287fee98eb91255eb9c56ef1642821ee3d914dd22","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-08c92e359bbbc110b0778b7e0b15d6f40000e6b1","semester":"1262","observed_at":"2025-08-21 07:05:14.730696+00:00","record_version_id":"7032eb665b0483f5348d9ae08d55cdbeba2880c2109ea8e0e2b31c6562268cab","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0944d76440dc778fbb89626058c10451009ce9c6","semester":"1262","observed_at":"2025-05-21 03:36:18.194118+00:00","record_version_id":"5741a6ed66d5a4a6fc51cd3d260790182e6316e26d7ac17f7f27ba8e25ea0aa1","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0a7f4bce29c816ef4d3d71b4eb8a2a3e15e33cc1","semester":"1262","observed_at":"2025-06-18 20:04:02.695444+00:00","record_version_id":"74d8efbf911728aea6420e314f1d06169d574154565997645ed3e3347884982c","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0ab917f827a7de22ebdc1087114d377a31c4687b","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"04135dfbedaf8861c14ba34c92d83d6a0196a3e4ffbe326ad4c0db050a063bd2","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0c40ecab4b6db9333d1f18aef816e3ee659e300c","semester":"1262","observed_at":"2025-05-25 18:02:34.797617+00:00","record_version_id":"b5b43c6bee1ecdea357944bc9f748958b8966b955f065985372761cdeb90cbc4","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0cb4d29a588ec7f11c7e00b7cf5dc3a0d23d0349","semester":"1266","observed_at":"2026-01-22 01:00:26.555427+00:00","record_version_id":"d44e978cd403caf30aff6118e6461909d5223f558f2feeb0415ad410c929b6b0","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-11c30ec39e91498cbfcf3a923c53a4b03e387280","semester":"1262","observed_at":"2025-07-20 04:58:26.847117+00:00","record_version_id":"9418350701139029fc9600a3e4c6c58d30a6368b4e714fde147b129d7967d5b1","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-13cd500edf2587e9a3428f326253738fbea965ea","semester":"1264","observed_at":"2025-12-14 04:50:04.653658+00:00","record_version_id":"5bcf1ce1e84d07abd82e7fe251c720a6097e6e6435977fa05d687a8de640b6af","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-1da08b2de39f05e6bc877c189fc2fd6eeda563f5","semester":"1262","observed_at":"2025-07-01 00:03:56.707251+00:00","record_version_id":"9b14a1f5652fd3ef276b20c23ddd98e9a5d9b353364e0f7973520ef22470974f","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2031af47efe133b0e7877f433286ff07385afc41","semester":"1262","observed_at":"2025-07-02 20:16:45.749584+00:00","record_version_id":"071370ff26ec3600081b7d19cd45456e9787917d24e416c993a27f6584271d34","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-238eba6f32fbc30407f616dd0628ff02a2a824dd","semester":"1262","observed_at":"2025-08-17 05:15:07.788352+00:00","record_version_id":"00e572d60e5c745bc8c0adab0f2ffe2d13945fd42464a09eff8a8c563bc6a315","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-25f0ff56bc4d80f8a8afa1a0bcce8dae6fddb5e5","semester":"1262","observed_at":"2025-05-25 17:20:25.942090+00:00","record_version_id":"d8d30d40f2d5dd3bcedcff265ec5015ac55a3bdf99b6b02219d956bcfea8f6ae","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2923f91826ce253b7aeefa9f75b4a39fe4c80ff0","semester":"1262","observed_at":"2025-08-10 05:10:25.938416+00:00","record_version_id":"f97b3e571b8d0360ca3d261519225f4507be711cbbc7e2fb1e36b8c862e96864","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2a05214a4023e0157fa6f7d188c85308f714176c","semester":"1262","observed_at":"2025-09-07 04:56:38.255315+00:00","record_version_id":"f3a640cc313949b599c99a6807d2a75c101398695fa29940c5325db2dc933b85","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2b1b8e39131de92b94620b25c5bbb25690efed4c","semester":"1262","observed_at":"2025-06-01 07:54:53.913454+00:00","record_version_id":"70f91515579af1ade63563bb4c7af39a18ddd6ab37242291dc1855274d1d493b","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-33a1225644e5a5855d60f66e65413946e72fedf4","semester":"1262","observed_at":"2025-06-22 01:52:05.152650+00:00","record_version_id":"1d203b9d6ac1b15baeeac9ba950c0898d80daa5601f94cf50c81bae2c6f154d8","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3b89c83dbf5208e13756184de1f2b2d0c09af35f","semester":"1262","observed_at":"2025-06-30 06:40:10.235522+00:00","record_version_id":"26f7112753e43e775234d0603545ebe8e19fe5c92b5da9c99e0ab622e1a5bfe0","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3c3eebf7f35c39364b445a2fa5a112ce28dbb4a1","semester":"1262","observed_at":"2025-06-01 17:03:59.062985+00:00","record_version_id":"c5fc18bc7aa19cb5bcd87f7c2a54c649961be4b60fbd2f43c87f4ea236246a3d","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3fa4dd71391f1c9cf4ab2216680bbc428689f92d","semester":"1262","observed_at":"2025-05-25 01:15:58.180530+00:00","record_version_id":"205819a6697da0002ad49ff099d78a4a39ec61d3303b9a8adf12763fccbf4021","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-4040aa216da722a34483f68fc1e129ea571ae08d","semester":"1262","observed_at":"2025-06-01 07:27:39.695506+00:00","record_version_id":"5d44eb8e017abf38b5953714456a0474799d5c696c3e80a494d1ce2c07cce1c8","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-454d53cd690294459f8ad0793cc3ed562060e56c","semester":"1262","observed_at":"2025-05-25 01:34:00.536004+00:00","record_version_id":"d2f2593f8b199dbe27ba08dbf850de8e425283a1c63020dfb59800f1bc0aa5d5","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-486f091e051fdb4ccdb80ee7b4fb0a5814510324","semester":"1264","observed_at":"2025-11-16 05:32:31.273726+00:00","record_version_id":"b997723205829d47be55e62a8d94128133b3a517935ab82f059513cac66380bf","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-50393cfc5fd5598d4f4731ef1919f2ff53af07d9","semester":"1262","observed_at":"2025-06-30 06:05:57.438846+00:00","record_version_id":"bbc509aca4507d4f20bd0ac1d2370ede68428e19843da6daef1fe4b264f9b6e3","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-50f6947786b208c800db8bbd0cec84a8f0f187d2","semester":"1262","observed_at":"2025-06-02 03:49:42.915428+00:00","record_version_id":"3ae22d204a80f770497dd4bd3813dea357e19150d682c8b74f7f64d50594a30b","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-51d86ed4082dced3803c295419b0ec8440942016","semester":"1264","observed_at":"2025-11-12 04:50:41.141307+00:00","record_version_id":"b997723205829d47be55e62a8d94128133b3a517935ab82f059513cac66380bf","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-53101bd1c10db0d00d094e4c9154d4c244ff23d9","semester":"1262","observed_at":"2025-10-05 04:58:05.366968+00:00","record_version_id":"d12780066274bd68d944159f3fe96a023a398d8233eded92b6f071dd401ac816","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-58751151c564e11c5cb8aedd3a2d3527c22f73eb","semester":"1262","observed_at":"2025-06-01 06:59:01.536576+00:00","record_version_id":"bfd107b5ac9b7e4b1ac6c63a71c38dd4d7b3b0dce24bc5e5d8cc9e033c4d77e7","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5c4c8d3701a333ba4ddadef7d0b5dde8440fcdf0","semester":"1262","observed_at":"2025-06-01 01:57:51.256704+00:00","record_version_id":"6e7a9835d739175463f05d079e6e323da9a8ac3b6175babccf9c969590738644","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5d20d9f81651d3c83fcaa2fd10870ce6e5d5a685","semester":"1262","observed_at":"2025-05-21 16:48:48.484741+00:00","record_version_id":"692771c8422e47902bfe3dded65cddb8a8c20711f70efeff42bec9e53e585a24","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5feaebf2ab37051c86ad360cc0fa0d7e0e2ea295","semester":"1262","observed_at":"2025-05-24 15:58:23.378859+00:00","record_version_id":"ed95bf0bda24560b52e1971903e87353ff3c8688dbe863ea986bd77a1a84916b","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-60949965544fce098cc006354e201149005fb77b","semester":"1264","observed_at":"2025-10-26 05:07:14.077864+00:00","record_version_id":"3fd7088749a05ce3a2f1c36c44fc065de069af1eacdac44834da07f026f581ea","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-639225ac3addf8522f1d30cb4fe26054ea7f8c49","semester":"1262","observed_at":"2025-06-01 08:14:42.497608+00:00","record_version_id":"4f62947f3b24802ea440a86c8adc94ebba57a102fa4b3f885d710505c8a0ea85","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-64093b17b3a9c67a41aa33eb37adb53ec38df714","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"3b85020a350aac32a25c0df93223142aecb175f54c8f5c801c9803199eddf4cf","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-6885b56099f55e08aa0205546369fb0381d50e13","semester":"1262","observed_at":"2025-07-13 04:59:22.367394+00:00","record_version_id":"25f598f9f2212dc818e96c39884755fc9db3bb99f1a7c0f2612748d018536187","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-69d4b2b16e8268f75b6390b3a0e2ce8bf73999da","semester":"1262","observed_at":"2025-06-30 03:21:29.925498+00:00","record_version_id":"bbc509aca4507d4f20bd0ac1d2370ede68428e19843da6daef1fe4b264f9b6e3","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-6b29c3e0673b2f9a736d2363db5409e03d5b3ed4","semester":"1264","observed_at":"2025-12-03 12:33:41.418072+00:00","record_version_id":"24f7f281acc6ead1e37dca07ff35786a8faaebf91848c97ea78f207f6f0e26d8","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-73259984748de484976ef2ad56ad7ab3d4cb4518","semester":"1262","observed_at":"2025-06-26 08:27:56.461216+00:00","record_version_id":"d991e256cd532393953f3172d466abca24b3ed5aa122ce257551c1bbc3be0069","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-741602fbc6252c232a0b9e6bc1a9ae3101625f5a","semester":"1262","observed_at":"2025-06-30 22:49:32.522034+00:00","record_version_id":"8830a90e6fc1625c18bf28b722aaa9dc01c88a96c23d4224583e23f0f000e110","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7774f45558276ec29bf626e58fffb4a27bdbb2a9","semester":"1264","observed_at":"2025-11-01 11:49:36.359151+00:00","record_version_id":"767750313d63554bb70aef2717c4b37838f83afa9a4656af84614f53f054a2b5","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7ab7c5e783fc8ebef8b8ee8cea019ee37a72ce74","semester":"1262","observed_at":"2025-09-28 04:58:07.340658+00:00","record_version_id":"f97b3e571b8d0360ca3d261519225f4507be711cbbc7e2fb1e36b8c862e96864","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7b2f22d83ea05055ab90dcb77dc802382cccc6f7","semester":"1262","observed_at":"2025-05-21 17:56:46.096741+00:00","record_version_id":"9cf5dfa5abe2d42f6dcdbe8c76cdd1d2b74c6661b21a526befa3381407acf958","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7ca1175502be18eb51f7b016818a884a43fd4ebb","semester":"1262","observed_at":"2025-07-29 06:28:23.644795+00:00","record_version_id":"25f598f9f2212dc818e96c39884755fc9db3bb99f1a7c0f2612748d018536187","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7d8cee5e42602ad9ba5dc0322085af2fa0dffaac","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"565058adfe781f3a5202f2e082d1a4e874b26d1ae479bf8cc340ef8b2eb9e456","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-81a0d6a7f668c98c59bd05fa988aa079c5ad1f68","semester":"1262","observed_at":"2025-05-31 07:49:50.419452+00:00","record_version_id":"7e04ac25a975c8b852dd2472e3ca23c2e9cec85d8ff5e8a452a836de1cc3059a","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-82f31c08c746a214872494cde6ecaeb9330441b4","semester":"1262","observed_at":"2025-06-17 21:26:08.547156+00:00","record_version_id":"1d203b9d6ac1b15baeeac9ba950c0898d80daa5601f94cf50c81bae2c6f154d8","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-84c248343c5a99ab42c5616c594812a5e3e31cbb","semester":"1262","observed_at":"2025-07-04 06:00:07.487827+00:00","record_version_id":"69ee6856c3eb254a6d2c8e8d3a0532c9920fa382345314f1fc6956229e064819","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-86334e7275e315853287e8580c35456c68df800b","semester":"1262","observed_at":"2025-05-22 06:53:03.336354+00:00","record_version_id":"0b7d6a012e1f8771f7a59b27d67f2a9157a12b70adfcbf07619b0be588a16bc3","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-8686dc1664f93a6c05f50321410961b39b12f91b","semester":"1262","observed_at":"2025-05-28 10:17:41.595894+00:00","record_version_id":"79d03ea663e10f1f5d39f573507e4ff747aa5d18de52171748b00323b04b035a","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-86d941366886c9a14a2581c04e20d0bdd25e1b02","semester":"1262","observed_at":"2025-08-31 04:54:14.656039+00:00","record_version_id":"2307e0ea55ed1e14f9cd5894b864df5dacd4328d0a0330295e340d4c561e81e3","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-8ba1d2e6cfbb1525b4f9f769ec164fb6ad0f237a","semester":"1262","observed_at":"2025-06-02 05:22:45.010398+00:00","record_version_id":"8666f863220eea3ab4cb91da68f7b620565ac62998c30b20562df10a39ddcd4e","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-90e5aa456689a3b222016c05c319bbcd0bddd453","semester":"1262","observed_at":"2025-05-25 02:00:10.037905+00:00","record_version_id":"af304c56ab6029595532aff83333f7edb4e0ba1ac4a0377d4854fda940c9af25","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-92d960aa7e4cd6e4c9ac8b2e232092904038e9e4","semester":"1262","observed_at":"2025-06-08 01:50:46.451351+00:00","record_version_id":"b059ea26c69e87c687fbe1e075a756addbbbad3c38813c73a01ed1834100983e","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-94002ae588a8f71eca6d64105f2e603e8587293b","semester":"1262","observed_at":"2025-05-21 09:01:16.021508+00:00","record_version_id":"eb5712aef9b05fae41bd3b9d3c159271e7db86019a9e8491ff51bdade19ab306","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-9dd575e013c5c6e000ab3ad2d1288cc1dd9c96dc","semester":"1264","observed_at":"2025-12-21 04:47:46.589081+00:00","record_version_id":"e613426eae931d88a9cf55f2df8d3d3de75ea1816cefb02b4f4a17f0ef57c1c1","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-a1ea26ed78cbd6e94bc3221e50a6ed9b6bf43871","semester":"1262","observed_at":"2025-05-25 09:16:55.180581+00:00","record_version_id":"0c87d3b4bae820020c263d425dad25e46797662bd25ecb1ee7fceb32323999b8","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-a76a3505853d5ea9c13bb98472b87361d469e2ee","semester":"1262","observed_at":"2025-05-28 18:03:41.793846+00:00","record_version_id":"922db307e690d51d89771459c5a0e77454b4df8afaa7ed82be181bc2a7f7482f","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b285d591f6acf3aa1910e02edc297664db86eb8c","semester":"1262","observed_at":"2025-06-10 22:48:22.460295+00:00","record_version_id":"f9fdc43817e0303c76345408c5ab308ac006e71f5edcaf82da25e37a1a02fbf6","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b79af756e4f00ba98231feb859ed8e98239eb811","semester":"1262","observed_at":"2025-05-22 02:47:56.931581+00:00","record_version_id":"f88bb28ba124fdd6180b9da58d5a05caeb347a4626b5c46f5820b41904951315","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b89e05b94730c6471439082d9279c0a834a4aeec","semester":"1262","observed_at":"2025-08-26 20:25:42.325239+00:00","record_version_id":"7d1aaac7798005810258f8bfce11d316c45910911303c69b7334fc5c65ea2f53","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b9279a12d1f2688df9e556183c94d41a89e431dc","semester":"1262","observed_at":"2025-07-06 01:49:47.203835+00:00","record_version_id":"5cff8a5e4600098f3152f4394c9afd1e0fb886c72bcf75d43e24cd0aeb0a1d60","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-bbdc905e96cc681a5e9a8b02c795b682206e36d1","semester":"1262","observed_at":"2025-06-25 08:02:45.445730+00:00","record_version_id":"c4a1b573d3279597ff221c4bea7034f90cc4dfd54130210e298d30a9f943a7d1","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-bde225b5243a13d81827aa173e39c78a652b54a0","semester":"1262","observed_at":"2025-05-23 07:22:33.219345+00:00","record_version_id":"82bf4ee953c1cea6471473c2e29d2d502ae0961045be9d9c36f898f420b38a76","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-c1fac4cbfde737f4f4ac02cdf15e6f5a9b5b676d","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"565058adfe781f3a5202f2e082d1a4e874b26d1ae479bf8cc340ef8b2eb9e456","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-c6b62be45f8a13cba109ef2a7741b9cd9a6b8272","semester":"1262","observed_at":"2025-08-24 08:48:09.035112+00:00","record_version_id":"b2fb6c408dbf46e7f8505a05f790c5d304ad412f381d0336823cfbd36f570f6b","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-cc83f62cb6db61f39320916d819ad48ce55cd96d","semester":"1262","observed_at":"2025-05-22 00:45:35.735230+00:00","record_version_id":"d8a008339ed8bed7043d5ddb3a80e6a51a20b860f481509e4d3419be85b22a8d","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d33818a01b6b4c5e2902e704da6e5b713742d4dc","semester":"1262","observed_at":"2025-10-13 10:46:24.251475+00:00","record_version_id":"7ccc5bd717f868d7d82dd6fe5d1d1512fc3ba99f5e0284539c3af2946608ecd2","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d3c17db9832d3064916046caf891dd23f10b1bb9","semester":"1262","observed_at":"2025-08-26 11:30:42.288639+00:00","record_version_id":"b0d790d5917a0d20b219ff17fc9bf7e5f965f05115f4e03af0ab7284cbcc069a","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d4ee226dc44268e9b6767fb9f5f20343322f494b","semester":"1262","observed_at":"2025-06-15 01:52:23.911697+00:00","record_version_id":"23049b87f9012802de68254fb471da66d397dcf334ae99f6490ce8b7585ff4be","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d8f9fc7f136e2033556d9d65bbdbdf33425dbdc9","semester":"1262","observed_at":"2025-05-28 16:48:12.400438+00:00","record_version_id":"4c64a1a841a4e096795c8b5d811ca86626853386d029374fe5f9ce9b10756021","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dbbc9739c616c3846b2e796e00a36fa41225f7d8","semester":"1262","observed_at":"2025-06-01 17:47:19.325144+00:00","record_version_id":"4ed929e9c939a9de5d171eac66367deed36991b2d29a135e9158d8bb08101792","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dbe5f2d24b48c3177297a3d69c553cc9d1194bac","semester":"1262","observed_at":"2025-09-14 05:00:27.366070+00:00","record_version_id":"24b781b39d2a4886f01477265393039519d9e7cd52a05664e4be7ec6c33747f4","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dd357dc2758e9e282c30988a527ce37de92593b9","semester":"1264","observed_at":"2025-10-19 01:39:41.951404+00:00","record_version_id":"237f458b752d06bd649e7859b93969308a1cf3e8cccf20c5f7f9d558bbb4e808","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-de74de559e409a3fe668685e28043b888d2e6841","semester":"1262","observed_at":"2025-06-27 07:38:50.882897+00:00","record_version_id":"85d60977e8509b2fe02575661e879fc90d37942c7cb2926fabe2d9920145aac6","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-deca7188cf536ade3203cd88b52a45e92a059617","semester":"1262","observed_at":"2025-06-27 00:37:46.087071+00:00","record_version_id":"db5bc70c0e80b536dc81268fb03080c30dbae73fbaa3c0e5effbdb66d469af5c","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-df60fa9ac3931c5612b0fa641b7a6f5fbec86fab","semester":"1262","observed_at":"2025-05-24 06:36:37.554678+00:00","record_version_id":"a38a4695c5fb6b56832fbac5f7bce30b09cbc908c0145ff9f9266e547ed9c1de","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-e339da2d849aaf8bb4dceca07a84728af23cf755","semester":"1262","observed_at":"2025-07-23 08:49:22.748925+00:00","record_version_id":"bea9d9d29f98235bb53612909dfdb839f3e5320768b7d0b591b0096d4f694565","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-e934b1784835f5d36ae9b7ef0992b11e72c39142","semester":"1262","observed_at":"2025-06-01 06:21:25.219533+00:00","record_version_id":"f4027d653b10fd49b6c3ba40ed6a02029a8fb6bfcffbc1932721b0bdcfd63462","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-ef471690c082448deebd2687eab84b0b78813c36","semester":"1262","observed_at":"2025-06-29 01:47:56.317645+00:00","record_version_id":"ee81e96be63f20fdb426383255eb41b319a8ad3a941d0d4f58f8920075357c5d","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-efc4e8e2cd7c3f68e059a308990c00c77c7611eb","semester":"1264","observed_at":"2025-10-16 05:48:13.935141+00:00","record_version_id":"a11407f8151f09fb2655882cdb68ad1842de0cf479f68b057c9fb4df1f267847","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-f18b7749725097d41f69c60779ff38cf073b93b3","semester":"1262","observed_at":"2025-05-21 19:52:03.259353+00:00","record_version_id":"31b17ae7dd4b8cb757f1b21584db29c694bfa870efb08b0a2dcb7d9e832e2c28","course_id":"COMPSCI 703","course_uid":"course_ecff5c2de6527b0350b0998a","catalog_version_id":"a13bc62b5475270de86df477ff548d087e7706f8c13f309daf18ec418970800c","course_number":703,"subjects":["COMPSCI"],"title":"PROGRAM VERIFICATION AND SYNTHESIS","description":"Formal methods for program verification. Model-checking techniques; linear temporal logic; computational tree logic; logic/automata connection; bisimulations; probabilistic model-checking. Special topics include: program synthesis, verification and synthesis of privacy properties. Knowledge of programming languages and compiler design strongly encouraged, such asCOMP SCI 536.","requirements_text":"Graduate/professional standing"}]